论文信息 - Implementation of SPARQL Query Language Based on Graph Homomorphism

Implementation of SPARQL Query Language Based on Graph Homomorphism

The sparql query 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 sparql query language and its pattern matching mechanism which is reformulated into a graph homomorphism checking constrained by filter evaluation.

Catherine Faron-Zucker | Olivier Corby | C. Faron-Zucker | O. Corby

[1] Xinghuo Yu,et al. AI 2004: Advances in Artificial Intelligence, 17th Australian Joint Conference on Artificial Intelligence, Cairns, Australia, December 4-6, 2004, Proceedings , 2004, Australian Conference on Artificial Intelligence.

[2] Madalina Croitoru,et al. A combinatorial approach to conceptual graph projection checking , 2004, SGAI Conf..

[3] Catherine Faron-Zucker,et al. Searching the semantic Web: approximate query processing based on ontologies , 2006, IEEE Intelligent Systems.

[4] Bernhard Ganter,et al. Conceptual Structures for Knowledge Creation and Communication , 2003, Lecture Notes in Computer Science.

[5] Olivier Corby,et al. Conceptual Graphs for Semantic Web Applications , 2005, ICCS.

[6] Jean-François Baget,et al. Simple Conceptual Graphs Revisited: Hypergraphs and Conjunctive Types for Efficient Projection Algorithms , 2003 .

[7] Gerd Stumme,et al. Conceptual Structures: Common Semantics for Sharing Knowledge. Proc. , 2005 .