Implementation of SPARQL Query Language Based on Graph Homomorphism

  • Olivier Corby
  • Catherine Faron-Zucker
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4604)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baget, J.F.: Simple Conceptual Graphs Revisited: Hypergraphs and Conjunctive Types for Efficient Projection Algorithms. In: Ganter, B., de Moor, A., Lex, W. (eds.) ICCS 2003. LNCS, vol. 2746, pp. 229–242. Springer, Heidelberg (2003)Google Scholar
  2. 2.
    Corby, O., Dieng, R., Faron, C., Gandon, F.: Searching the Semantic Web: Approximate Query Processing based on Ontologies. IEEE Intelligent Systems 21(1) (2006)Google Scholar
  3. 3.
    Dieng-Kuntz, R., Corby, O.: Conceptual Graphs for Semantic Web Applications. In: Dau, F., Mugnier, M.-L., Stumme, G. (eds.) ICCS 2005. LNCS (LNAI), vol. 3596, Springer, Heidelberg (2005)Google Scholar
  4. 4.
    Croitoru, M., Compatangelo, E.: A combinatorial approach to conceptual graph projection checking. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, pp. 130–143. Springer, Heidelberg (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Olivier Corby
    • 1
  • Catherine Faron-Zucker
    • 2
  1. 1.INRIA 2004 route des lucioles - BP 93, FR-06902 Sophia Antipolis cedex 
  2. 2.I3S, Université de Nice Sophia Antipolis, CNRS, 930 route des Colles - BP 145, FR-06903 Sophia Antipolis cedex 

Personalised recommendations