SPARQL Query Containment under SHI Axioms - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2012

SPARQL Query Containment under SHI Axioms

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

Abstract

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
RR-7943.pdf (893.49 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00691638 , version 1 (26-04-2012)

Identifiers

  • HAL Id : hal-00691638 , version 1

Cite

Melisachew Wudagae Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda. SPARQL Query Containment under SHI Axioms. [Research Report] RR-7943, Inria - Sophia Antipolis. 2012. ⟨hal-00691638⟩
242 View
102 Download

Share

Gmail Facebook Twitter LinkedIn More