Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Vincent Quint <>
Submitted on : Tuesday, September 6, 2011 - 10:53:17 AM
Last modification on : Tuesday, February 9, 2021 - 3:02:04 PM
Long-term archiving on: : Monday, December 5, 2016 - 2:17:48 AM


Files produced by the author(s)


  • HAL Id : hal-00619342, version 1



Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda. PSPARQL Query Containment. DBPL 2011 The 13th International Symposium on Database Programming Languages, Aug 2011, Seattle, United States. 8 p. ⟨hal-00619342⟩



Record views


Files downloads