Implementation of SPARQL Query Language Based on Graph Homomorphism

Authors:
Olivier Corby;Catherine Faron-Zucker
Affiliations:
INRIA 2004 route des lucioles - BP 93, FR-06902 Sophia Antipolis cedex,;I3S, Université de Nice Sophia Antipolis, CNRS, 930 route des Colles - BP 145, FR-06903 Sophia Antipolis cedex,
Venue:
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Year:
2007

Citing 2
Cited 3

Searching the Semantic Web: Approximate Query Processing Based on Ontologies

IEEE Intelligent Systems
Conceptual graphs for semantic web applications

ICCS'05 Proceedings of the 13th international conference on Conceptual Structures: common Semantics for Sharing Knowledge

SweetWiki: A semantic wiki

Web Semantics: Science, Services and Agents on the World Wide Web
Web, Graphs and Semantics

ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
Griwes: Generic Model and Preliminary Specifications for a Graph-Based Knowledge Representation Toolkit

ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The sparqlquery language is a W3C candidate recommendation for asking and answering queries against RDF data. It offers capabilities for querying by graph patternsand retrieval of solutions is based on graph pattern matching. This paper is dedicated to the implementation of the sparqlquery language and its pattern matching mechanism which is reformulated into a graph homomorphism checking constrained by filter evaluation.