Content-Based Overlay Networks for XML Peers Based on Multi-level Bloom Filters

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


Peer-to-peer systems are gaining popularity as a means to effectively share huge, massively distributed data collections. In this paper, we consider XML peers, that is, peers that store XML documents. We show how an extension of traditional Bloom filters, called multi-level Bloom filters, can be used to route path queries in such a system. In addition, we propose building content-based overlay networks by linking together peers with similar content. The similarity of the content (i.e., the local documents) of two peers is defined based on the similarity of their filters. Our experimental results show that overlay networks built based on filter similarity are very effective in retrieving a large number of relevant documents, since peers with similar content tend to be clustered together.


Hash Function Overlay Network Bloom Filter Path Query Path Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)MATHCrossRefGoogle Scholar
  2. 2.
    Fan, L., Cao, P., Almeida, J., Broder, A.: Summary cache: A scalable wide-area Web cache sharing protocol. In: Procs of ACM SIGCOMM Conference, September 1998, pp. 254–265 (1988)Google Scholar
  3. 3.
    Gribble, S.D., Brewer, E.A., Hellerstein, J.M., Culler, D.: Scalable Distributed Data Structures for Internet Service Construction. In: Procs. of the Fourth Symposium on Operating Systems Design and Implementation (2000)Google Scholar
  4. 4.
    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
  5. 5.
    Ramakrishna, M.V.: Practical performance of Bloom Filters and parallel free-text searching. Communications of the ACM 32(10), 1237–1239Google Scholar
  6. 6.
    Crespo, A., Garcia-Molina, H.: Routing Indices for Peer-to-peer Systems. In: ICDCS (2002)Google Scholar
  7. 7.
    Rhea, S.C., Kubiatowicz, J.: Probabilistic Location and Routing. In: INFOCOM (2002)Google Scholar
  8. 8.
    Crespo, A., Garcia-Molina, H.: Semantic Overlay Networks for P2P Systems (submitted for publication)Google Scholar
  9. 9.
    Koloniari, G., Pitoura, E.: Bloom-Based Filters for Hierarchical Data. In: WDAS 2003 (2003)Google Scholar
  10. 10.
    Triantafillou, P., Xiruhaki, C., Koubarakis, M., Ntarmos, N.: Towards High Performance Peer-to-Peer Content and Resource Sharing Systems. In: CIDR 2003 (2003)Google Scholar
  11. 11.
    Mohan, A., Kalogeraki, V.: Speculative Routing and Update Propagation: A Kundali Centric Approach. In: IEEE International Conference on Communications (ICC 2003) (May 2003)Google Scholar
  12. 12.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Procs. of the 2001 ACM SIGCOMM Conference (2001)Google Scholar
  13. 13.
    The MD5 Message-Digest Algorithm. RFC1321Google Scholar
  14. 14.
    The Niagara generator,
  15. 15.
    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, Budapest, Hungary, ACM, New York (2003) 1-58113-680-3/03/0005Google Scholar
  16. 16.
    Khambatti, M., Ryu, K., Dasgupta, P.: Peer-to-Peer Communities: Formation and Discovery. In: Fourteenth IASTED International Conference on Parallel and Distributed Computing and Systems, Cambridge (2002)Google Scholar
  17. 17.
    Milojicic, D.S., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: Peer-to-Peer Computing, HP Technical Report, HPL-2002-57Google Scholar
  18. 18.
    Abiteboul, S., Bonifati, A., Cobéna, G., Manolescu, I., Milo, T.: Dynamic XML Documents with Distribution and Replication. In: SIGMOD 2003, San Diego, CA (June 2003)Google Scholar
  19. 19.
    Saroiu, S., Gummadi, K., Gribble, S.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Conferencing and Networking (2002)Google Scholar
  20. 20.
    Annexstein, F.S., Berman, K.A., Jovanovic, M.A.: Latency Effects on Reachability in Large-scale Peer-to-Peer Networks. In: Procs. of the 13th annual ACM symposium on Parallel algorithms and architectures, Crete, Greece (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

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

Personalised recommendations