0.25
0.5
0.75
1.25
1.5
1.75
2
kyrie2: Query Rewriting under Extensional Constraints in ELHIO
Published on Dec 19, 20141616 Views
In this paper we study query answering and rewriting in ontology-based data access. Specifically, we present an algorithm for computing a perfect rewriting of unions of conjunctive queries posed over
Related categories
Chapter list
kyrie2: Query Rewriting under Extensional Constraints in ELHIO00:00
Index00:17
Query rewriting in OBDA00:39
What are extensional constraints?01:20
Stages in kyrie202:01
Example – TBox and EBox03:26
TBox clauses - SCC removal04:39
Unfolded UCQ - use the EBox05:58
Evaluation set up08:16
Results11:35
Results summary – Time to UCQ13:51
Results summary – UCQ number of clauses14:45
Conclusions and future lines15:12
Thank you!16:39