Skip to main content

Towards Parallel Processing of RDF Queries in DHTs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5697))

Abstract

Efficient RDF query evaluation is a requirement if the vision of a Semantic Web is to come true one day. Peer-to-peer (P2P) networks, specifically distributed hash tables (DHTs), could be one of the enabling technologies for the Semantic Web. Several DHT based RDF triple stores have been proposed but despite their differences they all process queries sequentially and hence leave an untapped potential for parallelism. This paper proposes and analyzes a scheme for parallel processing of RDF queries in DHTs. We describe a planning algorithm that attempts to reduce the response time of a query by considering parallel query plans prior to query execution. We provide an experimental evaluation of our approach and compare its results to an already existing scheme, i.e. the one of the BabelPeers project.

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. Berners-Lee, T., Hendler, J., Lassila, O.: The Semantic Web. Scientific American (2001)

    Google Scholar 

  2. Wilkinson, K., Sayers, C., Kuno, H., Reynolds, D.: Efficient RDF storage and retrieval in Jena2. In: Proceedings of SWDB 2003, The first International Workshop on Semantic Web and Databases, pp. 131–150 (2003)

    Google Scholar 

  3. 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, pp. 54–68. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Stocker, M., Seaborne, A., Bernstein, A., Kiefer, C., Reynolds, D.: SPARQL basic graph pattern optimization using selectivity estimation. In: WWW 2008: Proceeding of the 17th international conference on World Wide Web, pp. 595–604. ACM Press, New York (2008)

    Chapter  Google Scholar 

  5. Neumann, T., Weikum, G.: RDF-3X: a RISC-style engine for RDF. Proceedings of the VLDB Endowment archive 1(1), 647–659 (2008)

    Article  Google Scholar 

  6. Nejdl, W., Wolf, B., Qu, C., Decker, S., Sintek, M., Naeve, A., Nilsson, M., Palmér, M., Risch, T.: EDUTELLA: A P2P networking infrastructure based on RDF. In: WWW 2002: Proceedings of the 11th international conference on World Wide Web, pp. 604–615. ACM Press, New York (2002)

    Google Scholar 

  7. Cai, M., Frank, M.R.: RDFPeers: A scalable distributed RDF repository based on a structured peer-to-peer network. In: Proceedings of the 13th international conference on World Wide Web, WWW 2004, May 17-20, pp. 650–657. ACM Press, New York (2004)

    Google Scholar 

  8. Aberer, K., Cudré-Mauroux, P., Hauswirth, M., Pelt, T.V.: GridVine: Building internet-scale semantic overlay networks. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 107–121. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Heine, F.: P2P based RDF querying and reasoning for grid resource description and matching. PhD thesis, Universität Paderborn, Germany (2006)

    Google Scholar 

  10. Heine, F.: Scalable P2P based RDF querying. In: InfoScale 2006: Proceedings of the 1st international conference on Scalable information systems, p. 17. ACM Press, New York (2006)

    Google Scholar 

  11. Battré, D., Heine, F., Kao, O.: Top k RDF query evaluation in structured P2P networks. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds.) Euro-Par 2006. LNCS, vol. 4128, pp. 995–1004. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Battré, D.: Query Planning in DHT Based RDF Stores. In: IEEE International Conference on Signal Image Technology and Internet Based Systems, 2008. SITIS 2008, pp. 187–194 (2008)

    Google Scholar 

  13. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)

    Article  MATH  Google Scholar 

  14. Liarou, E., Idreos, S., Koubarakis, M.: Evaluating conjunctive triple pattern queries over large structured overlay networks. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 399–413. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Matono, A., Pahlevi, S.M., Kojima, I.: RDFCube: A P2P-based three-dimensional index for structural joins on distributed triple stores. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, J.-H., Ouksel, A.M. (eds.) DBISP2P 2005 and DBISP2P 2006. LNCS, vol. 4125, pp. 323–330. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  16. Chen, Y., Benn, W.: Query evaluation for distributed heterogeneous relational databases. In: COOPIS 1998: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems, Washington, DC, USA, pp. 44–53. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  17. Manola, F., Miller, E.: RDF Primer (February 2004), http://www.w3.org/TR/rdf-primer/

  18. Chen, M.S., Yu, P.S., Wu, K.L.: Optimization of parallel execution for multi-join queries. IEEE Transactions on Knowledge and Data Engineering 8, 416–428 (1996)

    Article  Google Scholar 

  19. Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., Price, T.G.: Access path selection in a relational database management system. In: SIGMOD 1979: Proceedings of the 1979 ACM SIGMOD international conference on Management of data, pp. 23–34. ACM Press, New York (1979)

    Chapter  Google Scholar 

  20. Guo, Y., Pan, Z., Heflin, J.: LUBM: A benchmark for OWL knowledge base systems. Web Semantics: Science, Services and Agents on the World Wide Web 3(2-3), 158–182 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lohrmann, B., Battré, D., Kao, O. (2009). Towards Parallel Processing of RDF Queries in DHTs. In: Hameurlain, A., Tjoa, A.M. (eds) Data Management in Grid and Peer-to-Peer Systems. Globe 2009. Lecture Notes in Computer Science, vol 5697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03715-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03715-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03714-6

  • Online ISBN: 978-3-642-03715-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics