PSPARQL Query Containment - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2011

PSPARQL Query Containment

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : inria-00598819 , version 2

Citer

Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda. PSPARQL Query Containment. [Research Report] INRIA. 2011. ⟨inria-00598819v2⟩
495 Consultations
167 Téléchargements

Partager

Gmail Facebook X LinkedIn More