Skip to main content

Query Graph Model for SPARQL

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 4231))

Abstract

Several query languages for RDF have been proposed before the World Wide Web Consortium started to standardize SPARQL. Due to the declarative nature of the proposed query languages, a query engine is responsible to choose an efficient evaluation strategy. Although all of the RDF repositories provide query capabilities, some of them disregard declarativeness during query evaluation.

In this paper, we propose a query graph model (QGM) for SPARQL supporting all phases of query processing. On top of the QGM we defined transformations rules to simplify the query specification as a preliminary step of query execution plan generation. Furthermore, the query graph model can easily be extended to represent new concepts.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alexaki, S., Christophides, V., Karvounarakis, G., Plexousakis, D., Tolle, K.: The RDFSuite: Managing Voluminous RDF Description Bases. In: Decker, S., Fensel, D., Sheth, A.P., Staab, S. (eds.) Proceedings of the Second International Workshop on the Semantic Web, pp. 1–13 (2001)

    Google Scholar 

  2. Broekstra, J., Kampman, A., van Harmelen, F.: Sesame: A generic architecture for storing and querying RDF and RDF schema. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, p. 54. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Wilkinson, K., Sayers, C., Kuno, H., Reynolds, D.: Efficient RDF Storage and Retrieval in Jena2. In: Cruz, I.F., Kashyap, V., Decker, S., Eckstein, R. (eds.) Proceedings of the First International Workshop on Semantic Web and Databases (2003)

    Google Scholar 

  4. Beckett, D.: The Design and Implementation of the Redland RDF Application Framework. In: Proceedings of the Tenth International Conference on World Wide Web. ACM Press, New York (2001)

    Google Scholar 

  5. Pirahesh, H., Hellerstein, J.M., Hasan, W.: Extensible/rule based query rewrite optimization in Starburst. SIGMOD Records 21(2), 39–48 (1992)

    Article  Google Scholar 

  6. Prud’hommeaux, E., Seaborne, A.: SPARQL Query Language for RDF, W3C Working Draft (2006)

    Google Scholar 

  7. Cyganiak, R.: A relational algebra for sparql. Technical Report HPL-2005-170, HP Laboratories Bristol (2005)

    Google Scholar 

  8. Frasincar, F., Houben, G.J., Vdovjak, R., Barna, P.: RAL: an Algebra for Querying RDF. In: Feldman, S.I., Uretsky, M., Najork, M., Wills, C.E. (eds.) Proceedings of the 13th International conference on World Wide Web. ACM Press, New York (2004)

    Google Scholar 

  9. Serfiotis, G., Koffina, I., Christophides, V., Tannen, V.: Containment and Minimization of RDF/S Query Patterns. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 607–623. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Matono, A., Amagasa, T., Yoshikawa, M., Uemura, S.: A path-based relational rdf database. In: CRPIT 1939: Proceedings of the sixteenth Australasian conference on Database technologies, pp. 95–103. Australian Computer Society, Inc., Darlinghurst (2005)

    Google Scholar 

  11. Christophides, V., Karvounarakis, G., Scholl, D.P.M., Tourtounis, S.: Optimizing Taxonomic Semantic Web Queries Using Labeling Schemes. Web Semantics: Science, Services and Agents on the World Wide Web 1(2), 207–228 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heese, R. (2006). Query Graph Model for SPARQL. In: Roddick, J.F., et al. Advances in Conceptual Modeling - Theory and Practice. ER 2006. Lecture Notes in Computer Science, vol 4231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908883_52

Download citation

  • DOI: https://doi.org/10.1007/11908883_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47703-7

  • Online ISBN: 978-3-540-47704-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics