Optimizing Query Answering under Ontological Constraints
Ontological queries are evaluated against a database combined with ontological constraints. Answering such queries is a challenging new problem for database research. For many ontological modelling languages, query answering can be solved via query rewriting: given a conjunctive query and an ontolog...
| Автори: | , |
|---|---|
| Формат: | Journal article |
| Опубліковано: |
2011
|
| _version_ | 1826276320541147136 |
|---|---|
| author | Orsi, G Pieris, A |
| author_facet | Orsi, G Pieris, A |
| author_sort | Orsi, G |
| collection | OXFORD |
| description | Ontological queries are evaluated against a database combined with ontological constraints. Answering such queries is a challenging new problem for database research. For many ontological modelling languages, query answering can be solved via query rewriting: given a conjunctive query and an ontology, the query can be transformed into a first-order query, called the perfect rewriting, that takes into account the semantic consequences of the ontology. Then, for every extensional database D, the answer to the query is obtained by evaluating the rewritten query against D. In this paper we present a new algorithm that computes the perfect rewriting of a conjunctive query w.r.t. a linear Datalog+/- ontology. Also, we provide an experimental comparison of our algorithm with existing rewriting techniques. |
| first_indexed | 2024-03-06T23:12:11Z |
| format | Journal article |
| id | oxford-uuid:65df8fd8-68cf-40d5-a786-9f16f4d0096e |
| institution | University of Oxford |
| last_indexed | 2024-03-06T23:12:11Z |
| publishDate | 2011 |
| record_format | dspace |
| spelling | oxford-uuid:65df8fd8-68cf-40d5-a786-9f16f4d0096e2022-03-26T18:28:17ZOptimizing Query Answering under Ontological ConstraintsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:65df8fd8-68cf-40d5-a786-9f16f4d0096eDepartment of Computer Science2011Orsi, GPieris, AOntological queries are evaluated against a database combined with ontological constraints. Answering such queries is a challenging new problem for database research. For many ontological modelling languages, query answering can be solved via query rewriting: given a conjunctive query and an ontology, the query can be transformed into a first-order query, called the perfect rewriting, that takes into account the semantic consequences of the ontology. Then, for every extensional database D, the answer to the query is obtained by evaluating the rewritten query against D. In this paper we present a new algorithm that computes the perfect rewriting of a conjunctive query w.r.t. a linear Datalog+/- ontology. Also, we provide an experimental comparison of our algorithm with existing rewriting techniques. |
| spellingShingle | Orsi, G Pieris, A Optimizing Query Answering under Ontological Constraints |
| title | Optimizing Query Answering under Ontological Constraints |
| title_full | Optimizing Query Answering under Ontological Constraints |
| title_fullStr | Optimizing Query Answering under Ontological Constraints |
| title_full_unstemmed | Optimizing Query Answering under Ontological Constraints |
| title_short | Optimizing Query Answering under Ontological Constraints |
| title_sort | optimizing query answering under ontological constraints |
| work_keys_str_mv | AT orsig optimizingqueryansweringunderontologicalconstraints AT pierisa optimizingqueryansweringunderontologicalconstraints |