Query rewriting over shallow ontologies
Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Zakharyaschev, Michael (2013) Query rewriting over shallow ontologies. In: Eiter, T. and Glimm, B. and Kazakov, Y. and Krötzsch, M. (eds.) Informal Proceedings of DL (Ulm, 23-26 July). CEUR Workshop Proceedings 1014. CEUR-WS, pp. 316-327.
|
Text
Hyper-DL.pdf - Author's Accepted Manuscript Download (453kB) | Preview |
Abstract
We investigate the size of rewritings of conjunctive queries over OWL2QL ontologies of depth 1 and 2 by means of a new hypergraph formalism for computing Boolean functions. Both positive and negative results are obtained. All conjunctive queries over ontologies of depth 1 have polynomial-size nonrecursive datalog rewritings; tree-shaped queries have polynomial-size positive existential rewritings; however, for some queries and ontologies of depth 1, positive existential rewritings can only be of superpolynomial size. Both positive existential and nonrecursive datalog rewritings of conjunctive queries and ontologies of depth 2 suffer an exponential blowup in the worst case, while first-order rewritings can grow superpolynomially unless NP is included in� P/poly.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | DL 2013 - Informal Proceedings of the 26th International Workshop on Description Logics - Ulm, Germany, July 23 - 26, 2013 - Series ISSN: 1613-073 |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Roman Kontchakov |
| Date Deposited: | 01 Aug 2014 14:45 |
| Last Modified: | 09 Aug 2023 12:35 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/10306 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |