Abstract
An important problem that confronts peer-to-peer (p2p) systems is efficient support for content-based search. In this paper, we look at how similarity query in high-dimensional spaces can be supported in unstructured P2P systems. We design an efficient index mechanism, named Linking Identical Neighborly Partitions (LINP), which takes advantage of both space partitioning and routing indices techniques. We evaluate our proposed scheme over various data sets, and experimental results show the efficacy of our approach.
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
Corel Image Features, available from http://kdd.ics.uci.edu
Castro, M., Costa, M., Rowstron, A.: Should we build gnutella on a structured overlay? In: Proc. of HotNets-II (2003)
Chakrabarti, K., Mehrotra, S.: Local dimensionality reduction: A new approach to indexing high dimensional spaces. In: Proc. of VLDB, pp. 89–100 (2000)
Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like p2p systems scalable. In: Proc. of SIGCOMM, pp. 407–418 (2003)
Crainiceanu, A., Linga, P., Gehrke, J., Shanmugasundaram, J.: P-tree: A p2p index for resource discovery applications. In: Proc. of WWW, pp. 390–391 (2004)
Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proc. of ICDCS, pp. 23–34 (2002)
Jagadish, H.V., Ooi, B.C., Vu, Q.H.: Baton: A balanced tree structure for peer-to-peer networks. In: Proc. of VLDB (2005)
Loo, B.T., Hellerstein, J.M., Huebsch, R., Shenker, S., Stoica, I.: Enhancing p2p file-sharing with an internet-scale query processor. In: Proc. of VLDB (2004)
Palmer, C.R., Steffan, J.G.: Generating network topologies that obey power law. In: Proc. of IEEE GLOBECOM (2000)
Reynolds, P., Vahdat, A.: Efficient peer-to-peer keyword searching. In: Proc. of ACM Middleware (2003)
Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. of SIGCOMM (2001)
Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high dimensional spaces. In: Proc. of VLDB (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Cui, B., Qian, W., Xu, L., Zhou, A. (2007). LINP: Supporting Similarity Search in Unstructured Peer-to-Peer Networks. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds) Advances in Data and Web Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72524-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-72524-4_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72483-4
Online ISBN: 978-3-540-72524-4
eBook Packages: Computer ScienceComputer Science (R0)