Efficient peer-to-peer similarity query processing for high-dimensional data

Ye Yuan*, Guoren Wang, Yongjiao Sun

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

Objects, such as a digital image, a text document or a DNA sequence are usually represented in a high dimensional feature space. A fundamental issue in (peer-to-peer) P2P systems is to support an efficient similarity search for high-dimensional data in metric spaces. Prior works suffer from some fundamental limitations, such as being not adaptive to a highly dynamic network, poor search efficiency under skewed data scenarios, large maintenance overhead and etc. In this study, we propose an efficient scheme, Dragon, to support P2P similarity search in metric spaces. Dragon achieves the efficiency through the following designs: 1) Dragon is based on our previous designed P2P network, Phoenix, which has the optimal routing efficiency in dynamic scenarios. 2) We design a locality-preserving naming algorithm and a routing tree for each peer in Phoenix to support range queries. A radius-estimated method is proposed to transform a kNN query to a range query. 3) A load-balancing algorithm is given to support strong query processing under skewed data distributions. Extensive experiments verify the superiority of Dragon over existing works.

Original languageEnglish
Title of host publicationAdvances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010
Pages195-201
Number of pages7
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event12th International Asia Pacific Web Conference, APWeb 2010 - Busan, Korea, Republic of
Duration: 6 Apr 20108 Apr 2010

Publication series

NameAdvances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010

Conference

Conference12th International Asia Pacific Web Conference, APWeb 2010
Country/TerritoryKorea, Republic of
CityBusan
Period6/04/108/04/10

Fingerprint

Dive into the research topics of 'Efficient peer-to-peer similarity query processing for high-dimensional data'. Together they form a unique fingerprint.

Cite this