SPARQL Query Containment under RDFS Entailment Regime - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

SPARQL Query Containment under RDFS Entailment Regime

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

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.
Fichier principal
Vignette du fichier
ijcar12.pdf (396.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda. SPARQL Query Containment under RDFS Entailment Regime. 6th International Joint Conference on Automated Reasoning (IJCAR), Jun 2012, Manchester, United Kingdom. pp.134-148, ⟨10.1007/978-3-642-31365-3_13⟩. ⟨hal-00749087⟩
385 View
211 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More