Dimartino, Mirko and Calì, Andrea and Poulovassilis, Alexandra and Wood, Peter T. (2016) Query rewriting under linear EL knowledge bases. In: Ortiz, M. and Schlobach, S. (eds.) Web Reasoning and Rule Systems: 10th International Conference, RR 2016, Aberdeen, UK, September 9-11, 2016, Proceedings. Lecture Notes in Computer Science 9898. New York, U.S.: Springer, pp. 61-76. ISBN 9783319452753.
|
Text
paper_10.pdf - Author's Accepted Manuscript Download (375kB) | Preview |
Abstract
With the adoption of the recent SPARQL 1.1 standard, RDF databases are capable of directly answering more expressive queries than simple conjunctive queries. In this paper we exploit such capabilities to answer conjunctive queries (CQs) under ontologies expressed in the description logic called linear EL-lin, a restricted form of EL. In particular, we show a query answering algorithm that rewrites a given CQ into a conjunctive regular path query (CRPQ) which, evaluated on the given instance, returns the correct answer. Our technique is based on the representation of infinite unions of CQs by non-deterministic finite-state automata. Our results achieve optimal data complexity, as well as producing rewritings straightforwardly implementable in SPARQL 1.1.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | The final publication is available at Springer via the link above. |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Research Centres and Institutes: | Innovation Management Research, Birkbeck Centre for, Bioinformatics, Bloomsbury Centre for (Closed), Birkbeck Knowledge Lab, Data Analytics, Birkbeck Institute for |
| Depositing User: | Alex Poulovassilis |
| Date Deposited: | 25 Aug 2016 14:29 |
| Last Modified: | 09 Aug 2023 12:38 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/15734 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
