Skip to Main content Skip to Navigation

SPARQL Query Containment under RDFS Entailment Regime

Melisachew Wudagae Chekol 1 Jérôme Euzenat 1 Pierre Genevès 2 Nabil Layaïda 2
1 EXMO - Computer mediated exchange of structured knowledge
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
2 WAM - Web, adaptation and multimedia
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important in many areas, including information integration, query optimization, and reasoning about Entity-Relationship diagrams. We encode this problem into an expressive logic called mu-calculus: where RDF graphs become transition systems, queries and schema axioms become formulas. Thus, the containment problem is reduced to formula satisfiability test. Beyond the logic's expressive power, satisfiability solvers are available for it. Hence, this study allows to exploit these advantages.
Document type :
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Melisachew Wudagae Chekol Connect in order to contact the contributor
Submitted on : Thursday, April 26, 2012 - 4:34:58 PM
Last modification on : Tuesday, November 16, 2021 - 5:04:01 PM
Long-term archiving on: : Thursday, December 15, 2016 - 2:20:18 AM


Files produced by the author(s)


  • HAL Id : hal-00691610, version 1


Melisachew Wudagae Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda. SPARQL Query Containment under RDFS Entailment Regime. [Research Report] RR-7942, Inria - Sophia Antipolis. 2012, pp.25. ⟨hal-00691610⟩



Record views


Files downloads