SPARQL Query Containment under Schema - Archive ouverte HAL Access content directly
Journal Articles Journal on Data Semantics Year : 2018

SPARQL Query Containment under Schema

(1) , (2) , (3) , (3)
Jérôme Euzenat
Pierre Genevès
Nabil Layaïda


Query containment is defined as the problem of determining if the result of a query is included in the result of another query for any dataset. It has major applications in query optimization and knowledge base verification. The main objective of this work is to provide sound and complete procedures to determine containment of SPARQL queries under expressive description logic schema axioms. Beyond that, these procedures are experimentally evaluated. To date, testing query containment has been performed using different techniques: containment mapping, canonical databases, automata theory techniques and through a reduction to the validity problem in logic. In this work, we use the latter technique to test containment of SPARQL queries using an expressive modal logic called µ-calculus. For that purpose, we define an RDF graph encoding as a transition system which preserves its characteristics. In addition, queries and schema axioms are encoded as µ-calculus formulae. Thereby, query containment can be reduced to testing validity in the logic. We identify various fragments of SPARQL and description logic schema languages for which containment is decidable. Additionally, we provide theoretically and experimentally proven procedures to check containment of these decidable fragments. Finally, we propose a benchmark for containment solvers which is used to test and compare the current state-of-the-art containment solvers.
Fichier principal
Vignette du fichier
jods18.pdf (483.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01767887 , version 1 (16-04-2018)
hal-01767887 , version 2 (06-06-2018)



Melisachew Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda. SPARQL Query Containment under Schema. Journal on Data Semantics, 2018, 7 (3), pp.133-154. ⟨10.1007/s13740-018-0087-1⟩. ⟨hal-01767887v2⟩
381 View
594 Download



Gmail Facebook Twitter LinkedIn More