Skip to main content
SpringerLink
Log in

Implementation of SPARQL Query Language Based on Graph Homomorphism

  • Conference paper
Conceptual Structures: Knowledge Architectures for Smart Applications (ICCS 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4604))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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. 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 

Download references

Author information

Authors and Affiliations

  1. INRIA 2004 route des lucioles - BP 93, FR-06902 Sophia Antipolis cedex,  

    Olivier Corby

  2. I3S, Université de Nice Sophia Antipolis, CNRS, 930 route des Colles - BP 145, FR-06903 Sophia Antipolis cedex,  

    Catherine Faron-Zucker

Authors
  1. Olivier Corby
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Catherine Faron-Zucker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Uta Priss Simon Polovina Richard Hill

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Corby, O., Faron-Zucker, C. (2007). Implementation of SPARQL Query Language Based on Graph Homomorphism. In: Priss, U., Polovina, S., Hill, R. (eds) Conceptual Structures: Knowledge Architectures for Smart Applications. ICCS 2007. Lecture Notes in Computer Science(), vol 4604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73681-3_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73681-3_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73680-6

  • Online ISBN: 978-3-540-73681-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation