Chapter

The Semantic Web – ISWC 2013

Volume 8219 of the series Lecture Notes in Computer Science pp 408-423

Evaluating and Benchmarking SPARQL Query Containment Solvers

  • Melisachew Wudage ChekolAffiliated withINRIA and LIGLORIA
  • , Jérôme EuzenatAffiliated withINRIA and LIG
  • , Pierre GenevèsAffiliated withCNRS
  • , Nabil LayaïdaAffiliated withINRIA and LIG

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Query containment is the problem of deciding if the answers to a query are included in those of another query for any queried database. This problem is very important for query optimization purposes. In the SPARQL context, it can be equally useful. This problem has recently been investigated theoretically and some query containment solvers are available. Yet, there were no benchmarks to compare theses systems and foster their improvement. In order to experimentally assess implementation strengths and limitations, we provide a first SPARQL containment test benchmark. It has been designed with respect to both the capabilities of existing solvers and the study of typical queries. Some solvers support optional constructs and cycles, while other solvers support projection, union of conjunctive queries and RDF Schemas. No solver currently supports all these features or OWL entailment regimes. The study of query demographics on DBPedia logs shows that the vast majority of queries are acyclic and a significant part of them uses UNION or projection. We thus test available solvers on their domain of applicability on three different benchmark suites. These experiments show that (i) tested solutions are overall functionally correct, (ii) in spite of its complexity, SPARQL query containment is practicable for acyclic queries, (iii) state-of-the-art solvers are at an early stage both in terms of capability and implementation.