SPARQL Query Containment Under SHI Axioms - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

SPARQL Query Containment Under SHI Axioms

(1) , (1) , (2) , (2)


SPARQL query containment under schema axioms is the problem of determining whether, for any RDF graph satisfying a given set of schema axioms, the answers to a query are contained in the answers of another query. This problem has major applications for verification and optimization of queries. In order to solve it, we rely on the mu-calculus. Firstly, we provide a mapping from RDF graphs into transition systems. Secondly, SPARQL queries and RDFS and SHI axioms are encoded into mu-calculus formulas. This allows us to reduce query containment and equivalence to satisfiability in the\mu-calculus. Finally, we prove a double exponential upper bound for containment under SHI schema axioms.
Fichier principal
Vignette du fichier
aaai12.pdf (259.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00749080 , version 1 (06-11-2012)


  • HAL Id : hal-00749080 , version 1


Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda. SPARQL Query Containment Under SHI Axioms. 26th AAAI Conference on Artificial Intelligence, Jul 2012, Toronto, Canada. pp.10-16. ⟨hal-00749080⟩
359 View
72 Download


Gmail Facebook Twitter LinkedIn More