Please use this identifier to cite or link to this item:
|Title:||LINP: Supporting similarity search in unstructured peer-to-peer networks||Authors:||Cui, B.
|Issue Date:||2007||Citation:||Cui, B., Qian, W., Xu, L., Zhou, A. (2007). LINP: Supporting similarity search in unstructured peer-to-peer networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4505 LNCS : 127-135. ScholarBank@NUS Repository.||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. © Springer-Verlag Berlin Heidelberg 2007.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/132900||ISBN:||9783540724834||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.