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
DBPL 2011 The 13th International Symposium on Database Programming Languages, Aug 2011, Seattle, United States. 8 p., 2011
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00619342
Contributor : Vincent Quint <>
Submitted on : Tuesday, September 6, 2011 - 10:53:17 AM
Last modification on : Thursday, October 11, 2018 - 8:48:03 AM
Document(s) archivé(s) le : Monday, December 5, 2016 - 2:17:48 AM

File

DBPL11.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00619342, version 1

Collections

Citation

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., 2011. 〈hal-00619342〉

Share

Metrics

Record views

871

Files downloads

201