Abstract
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.
This work was partially funded by the Information Society Technologies programme of the European Commission, Future and Emerging Technologies under the IST-2001-32645 DBGlobe project and by a Greek Ministry of Education program for Supporting Graduate Studies in Computer Science (EPEAEK II).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)
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)
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)
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)
Ramakrishna, M.V.: Practical performance of Bloom Filters and parallel free-text searching. Communications of the ACM 32(10), 1237–1239
Crespo, A., Garcia-Molina, H.: Routing Indices for Peer-to-peer Systems. In: ICDCS (2002)
Rhea, S.C., Kubiatowicz, J.: Probabilistic Location and Routing. In: INFOCOM (2002)
Crespo, A., Garcia-Molina, H.: Semantic Overlay Networks for P2P Systems (submitted for publication)
Koloniari, G., Pitoura, E.: Bloom-Based Filters for Hierarchical Data. In: WDAS 2003 (2003)
Triantafillou, P., Xiruhaki, C., Koubarakis, M., Ntarmos, N.: Towards High Performance Peer-to-Peer Content and Resource Sharing Systems. In: CIDR 2003 (2003)
Mohan, A., Kalogeraki, V.: Speculative Routing and Update Propagation: A Kundali Centric Approach. In: IEEE International Conference on Communications (ICC 2003) (May 2003)
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)
The MD5 Message-Digest Algorithm. RFC1321
The Niagara generator, http://www.cs.wisc.edu/niagara
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/0005
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)
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-57
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)
Saroiu, S., Gummadi, K., Gribble, S.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Conferencing and Networking (2002)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koloniari, G., Petrakis, Y., Pitoura, E. (2004). Content-Based Overlay Networks for XML Peers Based on Multi-level Bloom Filters. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P 2003. Lecture Notes in Computer Science, vol 2944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24629-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-24629-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20968-3
Online ISBN: 978-3-540-24629-9
eBook Packages: Springer Book Archive