A KNN Query Processing Algorithm over High-Dimensional Data Objects in P2P Systems

Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 144)


In this paper, we propose a quad-tree based distributed multi-dimensional data index (QDBI) for efficient data management and query processing in P2P system. In which, each peer use a MX-CIF quad-tree to generate index items of their high-dimensional data, and index items are organized into one dimensional ring structure, super-peers dynamically join the ring, the routing connections among super-peers are created, which are similar to Chord ring, thus forms a semantics-based structured super-peer network, and an efficient KNN query processing algorithm is proposed for high-dimensional data objects based on the index structure. Experiments show that the index structure and the KNN query algorithm have well search performance and scalability.


KNN query MX-CIF quad tree High-dimensional data objects 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: supporting scalable multi-attribute range queries. In: Proc. of SIGCOMM, pp. 353–366 (2004)Google Scholar
  2. 2.
    Jagadish, H.V., Ooi, B.C., Vu, Q.H.: Baton: A balanced tree structure for peer-to-peer networks. In: Proc. of VLDB, pp. 661–672 (2005)Google Scholar
  3. 3.
    Liu, B., Lee, W.-C., Lee, D.L.: Suppporting complex multi-dimensional queries in p2p systems. In: Proc. of ICDCS, pp. 155–164 (2005)Google Scholar
  4. 4.
    Li, M., Lee, W.-C., Sivasubramaniam, A.: Semantic Small World: An Overlay Network for Peer-to-Peer Search. In: Proc. of ICNP, pp. 238–248 (2004)Google Scholar
  5. 5.
    Li, M., Lee, W.-C., Sivasubramaniam, A., Zhao, J.: Supporting K nearest neighbors query on high-dimensional data in P2P systems. In: Proc. of Front. Comput. Sci., China, pp. 234–247 (2008)Google Scholar
  6. 6.
    Jagadish, H.V., Ooi, B.C., Vu, Q.H., Zhang, R., Zhou, A.: Vbi-tree: A peer-to-peer framework for supporting multi-dimensional indexing. In: Proc. of ICDE, pp. 34–43 (2006)Google Scholar
  7. 7.
    Chen, H., Jin, H., Wang, J., Chen, L., Liu, Y., Ni, L.: Efficient Multi-keyword Search over P2P Web. In: Proc. of WWW, pp. 989–997 (2008)Google Scholar
  8. 8.
    Crainiceanu, A., Linga, P., Machanavajjhala, A., Gehrke, J., Shanmugasundaram, J.: P-Ring: An Efficient and Robust P2P Range Index Structure. In: Proc. of SIGMOD, pp. 223–234 (2007)Google Scholar
  9. 9.
    Tang, Y., Zhou, S., Xu, J.: LigHT: A Query-Efficient yet Low-Maintenance Indexing Scheme over DHTs. In: Proc. of TKDE, pp. 59–75 (2010)Google Scholar
  10. 10.
    Tanin, E., Harwood, A., Samet, H.: Using a distributed quadtree index in peer-to-peer networks. The VLDB Journal 16(2), 165–178 (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  • Baiyou Qiao
    • 1
  • Linlin Ding
    • 1
  • Yong Wei
    • 1
  • Xiaoyang Wang
    • 1
  1. 1.Information Science and Engineering SchoolNortheastern UniversityShenyangChina

Personalised recommendations