PSPARQL Query Containment - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2011

PSPARQL Query Containment

Abstract

Querying the semantic web is mainly done through SPARQL. This language has been studied from different perspectives such as optimization and extension. One of its extensions, PSPARQL (Path SPARQL) provides queries with paths of arbitrary length. We study the static analysis of queries written in this language, in particular, containment of queries: determining whether, for any graph, the answers to a query are contained in those of another query. Our approach consists in encoding RDF graphs as transition systems and queries as $\mu$-calculus formulas and then reducing the containment problem to testing satisfiability in the logic. We establish complexity bounds and report experimental results
Fichier principal
Vignette du fichier
RR-7641.pdf (439.79 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00598819 , version 1 (07-06-2011)
inria-00598819 , version 2 (08-06-2011)

Identifiers

  • HAL Id : inria-00598819 , version 2

Cite

Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda. PSPARQL Query Containment. [Research Report] INRIA. 2011. ⟨inria-00598819v2⟩
506 View
168 Download

Share

Gmail Mastodon Facebook X LinkedIn More