Supporting K nearest neighbors query on high-dimensional data in P2P systems

Mei Li, Wang Chien Lee, Anand Sivasubramaniam, Jizhong Zhao

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


Peer-to-peer systems have been widely used for sharing and exchanging data and resources among numerous computer nodes. Various data objects identifiable with high dimensional feature vectors, such as text, images, genome sequences, are starting to leverage P2P technology. Most of the existing works have been focusing on queries on data objects with one or few attributes and thus are not applicable on high dimensional data objects. In this study, we investigate K nearest neighbors query (KNN) on high dimensional data objects in P2P systems. Efficient query algorithm and solutions that address various technical challenges raised by high dimensionality, such as search space resolution and incremental search space refinement, are proposed. An extensive simulation using both synthetic and real data sets demonstrates that our proposal efficiently supports KNN query on high dimensional data in P2P systems.

Original languageEnglish (US)
Pages (from-to)234-247
Number of pages14
JournalFrontiers of Computer Science in China
Issue number3
StatePublished - Sep 2008

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Supporting K nearest neighbors query on high-dimensional data in P2P systems'. Together they form a unique fingerprint.

Cite this