6533b7d5fe1ef96bd126391d
RESEARCH PRODUCT
Extending SPARQL with Temporal Logic
Radu Mateescu Sébastien Meriot Sylvain Rampaceksubject
[ INFO.INFO-MO ] Computer Science [cs]/Modeling and Simulation[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO][INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB][INFO.INFO-WB] Computer Science [cs]/Web[INFO.INFO-WB]Computer Science [cs]/Web[ INFO.INFO-WB ] Computer Science [cs]/WebInformationSystems_DATABASEMANAGEMENTlabeled transition system[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]ACM : H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.3: Languages/H.2.3.3: Query languagesSPARQL[INFO.INFO-MO]Computer Science [cs]/Modeling and Simulationmodel checkingRDFACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.4: Model checking[ INFO.INFO-DB ] Computer Science [cs]/Databases [cs.DB]temporal logicACM : D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.4: Model checking[INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB][ INFO.INFO-LO ] Computer Science [cs]/Logic in Computer Science [cs.LO]ACM: H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.3: Languages/H.2.3.3: Query languages[INFO.INFO-MO] Computer Science [cs]/Modeling and Simulationverificationdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2009-01-01 |