Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Extending SPARQL with Temporal Logic

Radu Mateescu 1, * Sébastien Meriot 1 Sylvain Rampacek 2
* Corresponding author
1 VASY - System validation - Research and applications
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : The data integration and sharing activities carried on in the framework of the Semantic Web lead to large knowledge bases that must be queried, analyzed, and exploited efficiently. Many of the knowledge representation languages of the Semantic Web, starting with RDF, are based on directed, labeled graphs, which can be also manipulated using graph algorithms and tools coming from other domains. In this paper, we propose an analysis approach of RDF graphs by reusing the verification technology developed for concurrent systems. To this purpose, we define a translation from the SPARQL query language into XTL, a general-purpose graph manipulation language implemented in the CADP verification toolbox for asynchronous concurrent systems. This translation makes it possible to extend the expressive power of SPARQL naturally by adding XTL temporal logic formulas characterizing sequences, trees, or general subgraphs of the RDF graph. Our approach exhibits a performance comparable with that of dedicated SPARQL query evaluation engines, as illustrated by experiments on large RDF graphs.
Complete list of metadata

https://hal.inria.fr/inria-00404761
Contributor : Radu Mateescu <>
Submitted on : Thursday, October 8, 2009 - 12:20:02 PM
Last modification on : Thursday, November 19, 2020 - 1:00:20 PM
Long-term archiving on: : Wednesday, September 22, 2010 - 1:48:02 PM

File

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

Identifiers

  • HAL Id : inria-00404761, version 2

Citation

Radu Mateescu, Sébastien Meriot, Sylvain Rampacek. Extending SPARQL with Temporal Logic. 2009. ⟨inria-00404761v2⟩

Share

Metrics

Record views

725

Files downloads

708