SPARQL Query Containment under SHI Axioms

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 : 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.
Type de document :
[Research Report] 2012
Liste complète des métadonnées
Contributeur : Melisachew Wudagae Chekol <>
Soumis le : jeudi 26 avril 2012 - 17:05:54
Dernière modification le : mardi 13 décembre 2016 - 15:44:12
Document(s) archivé(s) le : jeudi 15 décembre 2016 - 02:33:56


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00691638, version 1



Melisachew Wudagae Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda. SPARQL Query Containment under SHI Axioms. [Research Report] 2012. <hal-00691638>



Consultations de
la notice


Téléchargements du document