LINP: supporting similarity search in unstructured peer-to-peer networks

Authors:
Bin Cui;Weining Qian;Linhao Xu;Aoying Zhou
Affiliations:
Peking University, China;East China Normal University, China and Fudan University, China;National University of Singapore;East China Normal University, China and Fudan University, China
Venue:
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Year:
2007

Citing 10
Cited 1

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Routing Indices For Peer-to-Peer Systems

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Making gnutella-like P2P systems scalable

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
P-tree: a p2p index for resource discovery applications

Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
BATON: a balanced tree structure for peer-to-peer networks

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Enhancing P2P file-sharing with an internet-scale query processor

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient peer-to-peer keyword searching

Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware

P2P-based multidimensional indexing methods: A survey

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

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 indexmechanism, 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.