Extending SPARQL with Temporal Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2009

Extending SPARQL with Temporal Logic

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.
Fichier principal
Vignette du fichier
RR-7056.pdf (604.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00404761 , version 1 (08-10-2009)
inria-00404761 , version 2 (08-10-2009)

Identifiers

  • HAL Id : inria-00404761 , version 2

Cite

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

Share

Gmail Facebook X LinkedIn More