PSPARQL Query Containment

Melisachew Wudage 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 : 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
Document type :
Reports
[Research Report] INRIA. 2011
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/inria-00598819
Contributor : Melisachew Wudagae Chekol <>
Submitted on : Wednesday, June 8, 2011 - 3:54:09 PM
Last modification on : Thursday, October 11, 2018 - 8:48:03 AM

File

RR-7641.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00598819, version 2

Collections

Citation

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

Share

Metrics

Record views

769

Files downloads

167