Optimizing SPARQL Query Answering over OWL Ontologies

02/04/2014
by   Ilianna Kollia, et al.
0

The SPARQL query language is currently being extended by the World Wide Web Consortium (W3C) with so-called entailment regimes. An entailment regime defines how queries are evaluated under more expressive semantics than SPARQLs standard simple entailment, which is based on subgraph matching. The queries are very expressive since variables can occur within complex concepts and can also bind to concept or role names. In this paper, we describe a sound and complete algorithm for the OWL Direct Semantics entailment regime. We further propose several novel optimizations such as strategies for determining a good query execution order, query rewriting techniques, and show how specialized OWL reasoning tasks and the concept and role hierarchy can be used to reduce the query execution time. For determining a good execution order, we propose a cost-based model, where the costs are based on information about the instances of concepts and roles that are extracted from a model abstraction built by an OWL reasoner. We present two ordering strategies: a static and a dynamic one. For the dynamic case, we improve the performance by exploiting an individual clustering approach that allows for computing the cost functions based on one individual sample from a cluster. We provide a prototypical implementation and evaluate the efficiency of the proposed optimizations. Our experimental study shows that the static ordering usually outperforms the dynamic one when accurate statistics are available. This changes, however, when the statistics are less accurate, e.g., due to nondeterministic reasoning decisions. For queries that go beyond conjunctive instance queries we observe an improvement of up to three orders of magnitude due to the proposed optimizations.

READ FULL TEXT
research
10/22/2020

On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles

We study the description logic SQ with number restrictions applicable to...
research
04/29/2022

Finite Entailment of UCRPQs over ALC Ontologies

We investigate the problem of finite entailment of ontology-mediated que...
research
01/16/2014

Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend!

Description Logics are knowledge representation formalisms that provide,...
research
02/13/2019

SaGe: Web Preemption for Public SPARQL Query Services

To provide stable and responsive public SPARQL query services, data prov...
research
04/17/2018

Heuristic and Cost-based Optimization for Diverse Provenance Tasks

A well-established technique for capturing database provenance as annota...
research
05/01/2020

The ReProVide Query-Sequence Optimization in a Hardware-Accelerated DBMS

Hardware acceleration of database query processing can be done with the ...
research
07/20/2017

An extension of SPARQL for expressing qualitative preferences

In this paper we present SPREFQL, an extension of the SPARQL language th...

Please sign up or login with your details

Forgot password? Click here to reset