Kikot, Stanislav and Kontchakov, Roman and Zakharyaschev, Michael (2011) Polynomial conjunctive query rewriting under unary inclusion dependencies. In: Rudolph, S. and Gutierrez, C. (eds.) Web Reasoning and Rule Systems (5th International Conference, RR 2011). Lecture Notes in Computer Science 6902. Berlin, Germany: Springer, pp. 124-138. ISBN 9783642235795.
|
Text
RR-11-5.pdf - Author's Accepted Manuscript Download (446kB) | Preview |
Abstract
Ontology-based data access (OBDA) is widely accepted as an important ingredient of the new generation of information systems. In the OBDA paradigm, potentially incomplete relational data is enriched by means of ontologies, representing intensional knowledge of the application domain. We consider the problem of conjunctive query answering in OBDA. Certain ontology languages have been identified as FO-rewritable (e.g., DL-Lite and sticky-join sets of TGDs), which means that the ontology can be incorporated into the user's query, thus reducing OBDA to standard relational query evaluation. However, all known query rewriting techniques produce queries that are exponentially large in the size of the user's query, which can be a serious issue for standard relational database engines. In this paper, we present a polynomial query rewriting for conjunctive queries under unary inclusion dependencies. On the other hand, we show that binary inclusion dependencies do not admit polynomial query rewriting algorithms.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | The final publication is available at link.springer.com |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Roman Kontchakov |
| Date Deposited: | 13 May 2013 08:05 |
| Last Modified: | 09 Aug 2023 12:33 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/6641 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
