Skip to main content
SpringerLink
Log in

Linking identical neighborly partitions for efficient high-dimensional similarity search in unstructured peer-to-peer systems

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

Peer-to-Peer (P2P) computing has recently attracted a great deal of research attention. In a P2P system, a large number of nodes can potentially be pooled together to share their resources, information, and services. However, existing unstructured P2P systems lack support for content-based search over data objects which are generally represented by high-dimensional feature vectors. In this paper, we propose an efficient and effective indexing mechanism to facilitate high-dimensional similarity query in unstructured P2P systems, named Linking Identical Neighborly Partitions (LINP), which combines both space partitioning technique and routing index technique. With the aid of LINP, each peer can not only process similarity query efficiently over its local data, but also can route the query to the promising peers which may contain the desired data. In the proposed scheme, each peer summarizes its local data using the space partitioning technique, and exchanges the summarized index with its neighboring peers to construct routing indices. Furthermore, to improve the system performance with peer updates, we propose an extension of the LINP, named LINP+, where each peer can reconfigure its neighboring peers to keep relevant peers nearby. The performance of our proposed scheme is evaluated over both synthetic and real-life high-dimensional datasets, and experimental results show the superiority of our proposed scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Corel Image Features. Available from http://kdd.ics.uci.edu

  2. Aspnes, J., Shah, G.: Skip graphs. In: Proc. of SODA, pp. 384–393 (2003)

  3. Bernstein, P., Giunchiglia, F., Kementsietsidis, A., Mylopoulos, J., Serafini, L., Zaihrayeu, I.: Data management for peer-to-peer computing: A vision. In: Proc. of WebDB, pp. 89–94 (2002)

  4. Bohm, C., Berchtold, S., Keim, D.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. In: ACM Computing Surveys, pp. 322–373 (2001)

  5. Castro, M., Costa, M., Rowstron, A.: Should we build gnutella on a structured overlay? In: Proc. of HotNets-II (2003)

  6. Chakrabarti, K., Mehrotra, S.: Local dimensionality reduction: A new approach to indexing high dimensional spaces. In: Proc. of VLDB, pp. 89–100 (2000)

  7. Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like p2p systems scalable. In: Proc. of SIGCOMM, pp. 407–418 (2003)

  8. Cohen, E., Fiat, A., Kaplan, H.: Associative search in peer to peer networks: Harnessing latent semantics. Comput. Netw. 51(8), 1861–1881 (2007)

    Google Scholar 

  9. Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proc. of ICDCS, pp. 23–34 (2002)

  10. Cuenca-Acuna, F.M., Nguyen, T.D.: Text-based content search and retrieval in ad hoc p2p communities. In: Proc. of Networking, pp. 220–234 (2002)

  11. Cui, B., Qian, W., Xu, L., Zhou, A.: Linp: Efficient similarity search in unstructured peer-to-peer systems. In: Proc. of APWeb (2007)

  12. Doulkeridis, C., Vlachou, A., Kotidis, Y., Vazirgiannis, M.: Peer-to-peer similarity search in metric spaces. In: Proc. of VLDB, pp. 986–997 (2007)

  13. Ganesan, P., Bawa, M., Garcia-Molina, H.: Online balancing of range-partitioned data with applications to peer-to-peer systems. In: Proc. of VLDB (2004)

  14. Ganesan, P., Yang, B., Garcia-Molina, H.: One torus to rule them all: multi-dimensional queries in p2p systems. In: Proc. of WebDB, pp. 19–24 (2004)

  15. Jagadish, H.V., Ooi, B.C., Vu, Q.H.: Baton: A balanced tree structure for peer-to-peer networks. In: Proc. of VLDB (2005)

  16. 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 schemes. In: Proc. of ICDE, p. 34 (2006)

  17. Kalogeraki, V., Gunopulos, D., Zeinalipour-Yazti, D.: A local search mechanism for peer-to-peer networks. In: Proc. of CIKM, pp. 300–307 (2002)

  18. Liu, B., Lee, W.-C., Lee, D.L.: Supporting complex multi-dimensional queries in p2p systems. In: International Conference on Distributed Computing Systems, pp. 155–164 (2005)

  19. Loo, B.T., Hellerstein, J.M., Huebsch, R., Shenker, S., Stoica, I.: Enhancing p2p file-sharing with an Internet-scale query processor. In: Proc. of VLDB, pp. 432–443 (2004)

  20. Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proc. of ICS, pp. 84–95 (2002)

  21. Palmer, C.R., Steffan, J.G.: Generating network topologies that obey power law. In: Proc. of IEEE GLOBECOM (2000)

  22. Ratnasamy, S., Francis, P., Handley, K., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. of ACM SIGCOMM, pp. 161–172 (2001)

  23. Reynolds, P., Vahdat, A.: Efficient peer-to-peer keyword searching. In: Proc. of ACM Middleware (2003)

  24. Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proc. of IFIP/ACM Middleware, pp. 329–350 (2001)

  25. Sarshar, N.: Percolation search in power law networks: Making unstructured peer-to-peer networks scalable. In: Proc. of IEEE Peer-to-Peer Computing, pp. 2–9 (2004)

  26. Schmidt, C., Parashar, M.: Flexible information discovery in decentralized distributed systems. In: Proc. of IEEE HPDC, pp. 226–235 (2003)

  27. Shen, H.T., Shu, Y.F., Yu, B.: Efficient semantic-based content search in p2p network. IEEE Trans. Knowl. Data Eng. 17(7), 813–826 (2004)

    Article  Google Scholar 

  28. Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proc. of SIGCOMM (2001)

  29. Tang, C., Xu, Z., Dwarkadas, S.: Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proc. of SIGCOMM, pp. 175–186 (2003)

  30. Tran, D.A., Nguyen, T.: Hierarchical multidimensional search in peer-to-peer networks. Comput. Commun. 31(2), 346–357 (2008)

    Article  Google Scholar 

  31. Tsoumakos, D., Roussopoulos, N.: Adaptive probabilistic search for peer-to-peer networks. In: IEEE International Conference on Peer-to-Peer Computing, p. 102 (2003)

  32. Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high dimensional spaces. In: Proc. of VLDB, pp. 194–205 (1998)

  33. Wu, J.: A hybrid searching scheme in unstructured p2p networks. In: Proc. of ICPP, pp. 277–284 (2005)

  34. Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer networks. In: Proc. of ICDCS, p. 5 (2002)

  35. Yu, C., Ooi, B., Tan, K., Jagadish, H.V.: Indexing the distance: An efficient method to knn processing. In: Proc. of VLDB (2001)

  36. Yuan, F., Liu, J., Yin, C.: A scalable search algorithm on unstructured p2p networks. In: Proc. of SNPD, pp. 199–204 (2007)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Peking University, Beijing, China

    Bin Cui

  2. IBM China Research Lab, Beijing, China

    Linhao Xu

  3. China Electric Power Research Institute, Beijing, China

    Jiakui Zhao

Authors
  1. Bin Cui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Linhao Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiakui Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bin Cui.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cui, B., Xu, L. & Zhao, J. Linking identical neighborly partitions for efficient high-dimensional similarity search in unstructured peer-to-peer systems. Distrib Parallel Databases 26, 207 (2009). https://doi.org/10.1007/s10619-009-7053-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10619-009-7053-8

Keywords

Search

Navigation