Lower and upper bounds for SPARQL queries over OWL ontologies

6Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

The paper presents an approach for optimizing the evaluation of SPARQL queries over OWL ontologies using SPARQL's OWL Direct Semantics entailment regime. The approach is based on the computation of lower and upper bounds, but we allow for much more expressive queries than related approaches. In order to optimize the evaluation of possible query answers in the upper but not in the lower bound, we present a query extension approach that uses schema knowledge from the queried ontology to extend the query with additional parts. We show that the resulting query is equivalent to the original one and we use the additional parts that are simple to evaluate for restricting the bounds of subqueries of the initial query. In an empirical evaluation we show that the proposed query extension approach can lead to a significant decrease in the query execution time of up to four orders of magnitude.

Cite

CITATION STYLE

APA

Glimm, B., Kazakov, Y., Kollia, I., & Stamou, G. (2015). Lower and upper bounds for SPARQL queries over OWL ontologies. In Proceedings of the National Conference on Artificial Intelligence (Vol. 1, pp. 109–115). AI Access Foundation. https://doi.org/10.1609/aaai.v29i1.9192

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free