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.
Type de document :
Rapport
[Research Report] 2012, pp.25
Liste complète des métadonnées

https://hal.inria.fr/hal-00691610
Contributeur : Melisachew Wudagae Chekol <>
Soumis le : jeudi 26 avril 2012 - 16:34:58
Dernière modification le : mardi 13 décembre 2016 - 15:43:28
Document(s) archivé(s) le : jeudi 15 décembre 2016 - 02:20:18

Fichier

RR-7942.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00691610, version 1

Collections

Citation

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

Partager

Métriques

Consultations de
la notice

265

Téléchargements du document

243