Implementation of SPARQL Query Language Based on Graph Homomorphism

Abstract : The sparql query language is a W3C candidate recommendation for asking and answering queries against RDF data. It offers capabilities for querying by graph patterns and retrieval of solutions is based on graph pattern matching. This paper is dedicated to the implementation of the sparql query language and its pattern matching mechanism which is reformulated into a graph homomorphism checking constrained by filter evaluation.
Document type :
Conference papers
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/hal-01531157
Contributor : Olivier Corby <>
Submitted on : Thursday, June 1, 2017 - 11:41:44 AM
Last modification on : Wednesday, January 31, 2018 - 10:24:04 AM
Long-term archiving on : Wednesday, September 6, 2017 - 6:48:40 PM

File

iccs2007-final.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Olivier Corby, Catherine Faron Zucker. Implementation of SPARQL Query Language Based on Graph Homomorphism. International Conference on Conceptual Structures, Jul 2007, Sheffield, United Kingdom. ⟨10.1007/978-3-540-73681-3_37⟩. ⟨hal-01531157⟩

Share

Metrics

Record views

266

Files downloads

238