Abstract
Peer-to-peer systems offer an efficient means for sharing data among autonomous nodes. A central issue is locating the nodes with data matching a user query. A decentralized solution to this problem is based on using routing indexes which are data structures that describe the content of neighboring nodes. Each node uses its routing index to route a query towards those of its neighbors that provide the largest number of results. We consider using histograms as routing indexes. We describe a decentralized procedure for clustering similar nodes based on histograms. Similarity between nodes is defined based on the set of queries they match and related with the distance between their histograms. Our experimental results show that using histograms to cluster similar nodes and to route queries increases the number of results returned for a given number of nodes visited.
Work supported in part by the IST programme of the European Commission FET under the IST-2001-32645 DBGlobe project.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bawa, M., Manku, G.S., Raghavan, P.: SETS: Search Enhanced by Topic Segmentation. In: SIGIR (2003)
Cha, S.-H., Sribari, S.N.: On Measuring the Distance Between Histograms. Patern Recognition 35, 1355–1370 (2002)
Crespo, A., Garcia-Molina, H.: Routing Indices for Peer-to-Peer Systems. In: ICDCS (2002)
Crespo, A., Garcia-Molina, H.: Semantic Overlay Networks for P2P Systems. Technical report, Submitted for publication (2002)
Ganesan, P., Yang, B., Garcia-Molina, H.: One Torus to Rule Them All: Multidimensional Queries in P2P Systems. In: ICDE (2004)
Morris, R., Stoica, I., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. IEEE/ACM Trans. on Networking 11(1), 17–32 (2003)
Ioannidis, Y.: The History of Histograms. In: VLDB (2003)
Khambatti, M.S., Ryu, K.D., Dasgupta, P.: Efficient Discovery of Implicitly Formed Peer-to-Peer Communities. International Journal of Parallel and Distributed Systems and Networks 5(4), 155–164 (2002)
Wang, Y., Jeffrey, S.R., Galanis, L., DeWitt, D.J.: Processing Queries in a Large Peer-to-Peer System. In: Caise (2003)
Loser, A., Naumann, F., Siberski, W., Nejdl, W., Thaden, U.: Semantic Overlay Clusters within Super-Peer Networks. In: International Workshop on Databases, Information Systems and Peer-to-Peer Computing (2003)
Milojicic, D.S., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: Peer-to-Peer Computing. Technical Report HPL-2002-57, HP Laboratories Palo Alto (2002)
Petrakis, Y., Pitoura, E.: On Constructing Small Worlds in Unstructured Peer-to-Peer Systems. In: EDBT International Workshop on Peer-to-Peer Computing and Databases (2004)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A Scalable Content-Addressable Network. In: SIGCOMM (2001)
Rhea, S.C., Kubiatowicz, J.: Probabilistic Location and Routing. In: INFOCOM (2002)
Sahin, O.D., Gupta, A., Agrawal, D., El Abbadi, A.: A Peer-to-peer Framework for Caching Range Queries. In: ICDE (2004)
Triantafillou, P., Pitoura, T.: Towards a Unifying Framework for Complex Query Processing over Structured Peer-to-Peer Data Networks. In: DBISP2P (2003)
Triantafillou, P., Xiruhaki, C., Koubarakis, M., Ntarmos, N.: Towards High Performance Peer-to-Peer Content and Resource Sharing Systems. In: CIDR (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Petrakis, Y., Koloniari, G., Pitoura, E. (2005). On Using Histograms as Routing Indexes in Peer-to-Peer Systems. In: Ng, W.S., Ooi, BC., Ouksel, A.M., Sartori, C. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P 2004. Lecture Notes in Computer Science, vol 3367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31838-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-31838-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25233-7
Online ISBN: 978-3-540-31838-5
eBook Packages: Computer ScienceComputer Science (R0)