Content-Based Routing of Path Queries in Peer-to-Peer Systems

  • Georgia Koloniari
  • Evaggelia Pitoura
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2992)

Abstract

Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in which the nodes in a P2P system store XML documents. We propose a fully decentralized approach to the problem of routing path queries among the nodes of a P2P system based on maintaining specialized data structures, called filters that efficiently summarize the content, i.e., the documents, of one or more node. Our proposed filters, called multi-level Bloom filters, are based on extending Bloom filters so that they maintain information about the structure of the documents. In addition, we advocate building a hierarchical organization of nodes by clustering together nodes with similar content. Similarity between nodes is related to the similarity between the corresponding filters. We also present an efficient method for update propagation. Our experimental results show that multi-level Bloom filters outperform the classical Bloom filters in routing path queries. Furthermore, the content-based hierarchical grouping of nodes increases recall, that is, the number of documents that are retrieved.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Milojicic, D.S., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: Peer-to-Peer Computing, HP Laboratories Palo Alto, HPL-2002-57Google Scholar
  2. 2.
    Gribble, S.D., Brewer, E.A., Hellerstein, J.M., Culler, D.: Scalable Distributed Data Structures for Internet Service Construction. In: OSDI 2000 (2000)Google Scholar
  3. 3.
    Bloom, B.: Space/Time Trade-offs in Hash Coding with Allowable Errors. CACM 13(7) (July 1970)Google Scholar
  4. 4.
    Fan, L., Cao, P., Almeida, J., Broder, A.: Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol. In: SIGCOMM 1998 (1998)Google Scholar
  5. 5.
    Hodes, T.D., Czerwinski, S.E., Zhao, B.Y., Joseph, A.D., Katz, R.H.: Architecture for Secure Wide-Area Service Discovery. In: Mobicom 1999 (1999)Google Scholar
  6. 6.
    The MD5 Message-Digest Algorithm. RFC1321Google Scholar
  7. 7.
    The Niagara generator, http://www.cs.wisc.edu/niagara
  8. 8.
  9. 9.
    Goldman, R., Widom, J.: DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases. In: VLDB 1997 (1997)Google Scholar
  10. 10.
    Cooper, B.F., Sample, N., Franklin, M.J., Hjaltason, G.R., Shadmon, M.: Fast Index for Semistructured Data. In: VLDB 2001 (2001)Google Scholar
  11. 11.
    Polyzotis, N., Garofalakis, M.: Structure and Value Synopses for XML Data Graphs. In: VLDB 2002 (2002)Google Scholar
  12. 12.
    Park, S., Kim, H.J.: A New Query Processing Technique for XML Based on Signature. In: DASFAA 2001 (2001)Google Scholar
  13. 13.
    Faloutsos, C., Christodoulakis, S.: Signature Files: An Access Method for Documents and Its Analytical Performance Evaluation. ACM TOIS 2(4) (October 1984)Google Scholar
  14. 14.
    Mohan, A., Kalogeraki, V.: Speculative Routing and Update Propagation: A Kundali Centric Approach. In: ICC 2003 (2003)Google Scholar
  15. 15.
    Crespo, A., Garcia-Molina, H.: Semantic Overlay Networks for P2P Systems (submitted for publication)Google Scholar
  16. 16.
    Nejdl, W., Wolpers, M., Siberski, W., Schmitz, C., Schlosser, M., Brunkhorst, I., Loser, A.: Super-Peer-Based Routing and Clustering Strategies for RDF-Based Peer-To-Peer Networks. In: WWW 2003 (2003)Google Scholar
  17. 17.
    Koloniari, G., Pitoura, E.: Bloom-Based Filters for Hierarchical Data. In: WDAS 2003 (2003)Google Scholar
  18. 18.
    Koloniari, G., Petrakis, Y., Pitoura, E.: Content-Based Overlay Networks of XML Peers Based on Multi-Level Bloom Filters. In: VLDB International Workshop on Databases, Information Systems and Peer-to-Peer Computing (2003)Google Scholar
  19. 19.
    Crespo, A., Garcia-Molina, H.: Routing Indices for Peer-to-Peer Systems. In: ICDCS 2002 (2002)Google Scholar
  20. 20.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: SIGCOMM 2001 (2001)Google Scholar
  21. 21.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: SIGCOMM 2001 (2001)Google Scholar
  22. 22.
  23. 23.
    Pitoura, E., Abiteboul, S., Pfoser, D., Samaras, G., Vazirgiannis, M.: DBGlobe: a Service-oriented P2P System for Global Computing. SIGMOD Record 32(3) (2003)Google Scholar
  24. 24.
    Koloniari, G., Pitoura, E.: Content-Based Routing of Path Queries in Peer-to-Peer Systems (extended version). Computer Science Dept, Univ. of Ioannina, TR-2003-12Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Georgia Koloniari
    • 1
  • Evaggelia Pitoura
    • 1
  1. 1.Department of Computer ScienceUniversity of IoanninaGreece

Personalised recommendations