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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Corby, O., & Faron-Zucker, C. (2007). Implementation of SPARQL query language based on graph homomorphism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4604 LNAI, pp. 472–475). Springer Verlag. https://doi.org/10.1007/978-3-540-73681-3_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
