论文信息 - Supporting Similarity Range Queries Efficiently by Using Reference Points in Structured P2P Overlays

Supporting Similarity Range Queries Efficiently by Using Reference Points in Structured P2P Overlays

In recent years, the research issues in peer to peer (P2P) systems have been discussed widely. In a P2P system, the role of each node is the same, and the nodes simultaneously function as both clients and servers to the other nodes on the network. Many studies have been proposed for solving different problems to improve the performance of P2P systems. To solve file availability and network flow problems, a method named distributed hash tables (DHT) has been proposed. However, these DHT-based systems are not able to support efficient queries such as similarity queries, range queries, and skyline queries.

Guanling Lee | Yi-Chun Chen | Chung Chi Lee

[1] Anand Sivasubramaniam,et al. PENS: an algorithm for density-based clustering in peer-to-peer systems , 2006, InfoScale '06.

[2] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[3] Zhichen Xu,et al. pSearch: information retrieval in structured overlays , 2003, CCRV.

[4] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM 2001.

[5] Jianliang Xu,et al. A Lightweight Multidimensional Index for Complex Queries over DHTs , 2011, IEEE Transactions on Parallel and Distributed Systems.

[6] Yehoshua Sagiv,et al. KMV-peer: a robust and adaptive peer-selection algorithm , 2011, WSDM '11.

[7] Beng Chin Ooi,et al. iDistance: An adaptive B+-tree based indexing method for nearest neighbor search , 2005, TODS.

[8] David Novak,et al. M-Chord: a scalable distributed similarity search structure , 2006, InfoScale '06.

[9] Jianliang Xu,et al. LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs , 2010, IEEE Transactions on Knowledge and Data Engineering.

[10] Pavel Zezula,et al. A Content-Addressable Network for Similarity Search in Metric Spaces , 2005, DBISP2P.