Skip to main content
SpringerLink
Log in

Continually Answering Constraint k-NN Queries in Unstructured P2P Systems

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

We consider the problem of efficiently computing distributed geographical k-NN queries in an unstructured peer-to-peer (P2P) system, in which each peer is managed by an individual organization and can only communicate with its logical neighboring peers. Such queries are based on local filter query statistics, and require as less communication cost as possible, which makes it more difficult than the existing distributed k-NN queries. Especially, we hope to reduce candidate peers and degrade communication cost. In this paper, we propose an efficient pruning technique to minimize the number of candidate peers to be processed to answer the k-NN queries. Our approach is especially suitable for continuous k-NN queries when updating peers, including changing ranges of peers, dynamically leaving or joining peers, and updating data in a peer. In addition, simulation results show that the proposed approach outperforms the existing Minimum Bounding Rectangle (MBR)-based query approaches, especially for continuous queries.

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. Hjaltason G R, Samet H. Distance browsing in spatial databases. ACM Trans. Database Syst., 1999, 24(2): 265–318.

    Article  Google Scholar 

  2. Korn F, Sidiropoulos N, Faloutsos C et al. Fast nearest neighbor search in medical image databases. In Proc. 22nd Int. Conf. Very Large Data Bases, Mumbai (Bombay), India, 1996, pp.215–226.

  3. Mouratidis K, Yiu M L, Papadias D et al. Continuous nearest neighbor monitoring in road networks. In Proc. 32nd Int. Conf. Very Large Data Bases, Seoul, Korea, 2006, pp.43–54.

  4. Seidl T, Kriegel H. Optimal multi-step k-nearest neighbor search. In Proc. ACM SIGMOD Int. Conf. Management of Data, Seattle, Washington, USA, 1998, pp.154–165.

  5. Wang Y F, Hori Y, Sakurai K. Characterizing economic and social properties of trust and reputation systems in P2P environment. Journal of Computer Science and Technology, 2008, 23(1): 129–140.

    Article  Google Scholar 

  6. V T de Almeida, R H Güting. Using dijkstra's algorithm to incrementally find the k-nearest neighbors in spatial network databases. In Proc. the 2006 ACM Symposium on Applied Computing (SAC), Dijon, France, 2006, pp.58–62.

  7. Hu H, Lee D L, Xu J. Fast nearest neighbor search on road networks. In Proc. 10th International Conference on Extending Database Technology (EDBT), Munich, Germany, Lecture Notes in Computer Science, 3896, 2006, pp.186–203.

  8. Kolahdouzan M R, Shahabi C. Voronoi-based k nearest neighbor search for spatial network databases. In Proc. 30th Int. Conf. Very Large Data Bases, Toronto, Canada, 2004, pp.840–851.

  9. Yiu M L, Papadias D, Mamoulis N, Tao Y. Reverse nearest neighbors in large graphs. IEEE Trans. Knowl. Data Eng., 2006, 18(4): 540–553.

    Article  Google Scholar 

  10. Jagadish H V, Ooi B C, Vu Q et al. Vbi-tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes. In Proc. 22th Int. Conf. Data Engineering, Atlanta, GA, USA, 2006, p.34.

  11. Jagadish H V, Ooi B C, Vu Q H. Baton: A balanced tree structure for peer-to-peer networks. In Proc. 23rd Int. Conf. Very Large Data Bases, Trondheim, Norway, 2005, pp.661–672.

  12. Tanenbaum A S. Computer Networks. Third edition, Prentice Hall PTR, ISBN 0-13-349945-6, 1996, pp.355–359.

  13. Silberstein A, Braynard R, Ellis C et al. A sampling-based approach to optimizing top-k queries in sensor networks. In Proc. 22nd Int. Conf. Data Engineering, Atlanta, GA, USA, 2006, p.68.

  14. Robinsy G, Zelikovskyz A. Improved Steiner tree approximation in graphs. In Proc. the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, USA, 2000, pp.770–779.

  15. Saltenis S, Jensen C S, Leutenegger S T et al. Indexing the positions of continuously moving objects. In Proc. ACM SIGMOD Int. Conf. Management of Data, Dallas, Texas, USA, 2000, pp.331–342.

  16. Tao Y, Papadias D. MV3R-tree: A spatio-temporal access method for timestamp and interval queries. In Proc. 27th Int. Conf. Very Large Data Bases, Rome, Italy, 2001, pp.431–440.

  17. Ratnasamy S, Francis P, Handley M et al. A scalable content addressable network. In Proc. the 2001 ACM SIGCOMM Conference, Santa Barbara, CA, USA, 2001, pp.161–172.

  18. Stoica I, Morris R, Karger D et al. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. the 2001 ACM SIGCOMM Conference, Santa Barbara, CA, USA, 2001, pp.149–160.

  19. Rowstron A, Druschel P. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proc. the 18th IFIP/ACM International Conf. Distributed Systems Platforms, Heidelberg, Germany, Lecture Notes in Computer Science, 2218, 2001, pp.329–350.

  20. Zhao B Y, Kubiatowicz K, Joseph A D. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report, University of California, Berkeley, 2001.

  21. Aberer K, Mauroux P C, Datta A, Despotovic Z, Hauswirth M, Punceva M, Schmidt R. P-grid: A self-organizing structured p2p system. SIGMOD Record, 2003, 32(3): 29–33.

    Article  Google Scholar 

  22. Crainiceanu A, Linga P, Machanavajjhala A et al. P-ring: An index structure for peer-to-peer systems. Technical Report, TR2004-1946, Cornell University, 2004.

  23. Bharambe A, Agrawal M, Seshan S. Mercury: Supporting scalable multi-attribute range queries. In Proc. the 2004 ACM SIGCOMM Conference, Portland, Oregon, USA, 2004, pp.329–350.

  24. Gnutella. http://www.gnutella.com/.

  25. Guttman A. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. Management of Data, Boston, Massachusetts, USA, 1984, pp.47–57.

  26. Bentley J. Multidimensional binary search trees used for associative searching. Commun. ACM, 1975, 18(9): 509–517.

    Article  MATH  MathSciNet  Google Scholar 

  27. Lin K I, Jagadish H V, Faloutsos C. The tv-tree: An index structure for high-dimensional data. The VLDB Journal, 1994, 3(4): 517–542.

    Article  Google Scholar 

  28. Katayama N, Satoh S. The sr-tree: An index structure for high-dimensional nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. Management of Data, Tucson, Arizona, USA, 1997, pp.369–380.

  29. Berchtold S, Keim D A, Kriegel H P. The x-tree: An index structure for high-dimensional data. In Proc. 22nd Int. Conf. Very Large Data Bases, Bombay, India, 1996, pp.28–39.

  30. Uhlmann J K. Satisfying general proximity/similarity queries with metric trees. Information Processing Letter, 1991, 40(4): 175–179.

    Article  MATH  Google Scholar 

  31. Brin S. Near neighbor search in large metric spaces. In Proc. 21st Int. Conf. Very Large Data Bases, Zurich, Switzerland, 1995, pp.574–584.

  32. Navarro G. Searching in metric spaces by spatial approximation. The VLDB Journal, 2002, 11: 28–46.

    Article  Google Scholar 

  33. Ciaccia P, Patella M, Zezula P. M-tree: An efficient access method for similarity search in metric spaces. In Proc. 23rd Int. Conf. Very Large Data Bases, Athens, Greece, 1997, pp.426–435.

  34. Bozkaya T, Ozsoyoglu M. Indexing large metric spaces for similarity search queries. ACM Trans. Database Syst., 1999, 24(3): 361–404.

    Article  Google Scholar 

  35. Fagin R, Lotem A, Naor M. Optimal aggregation algorithms for middleware. In Proc. ACM SIGACT-SIGMOD Symp. Principles of Database Systems, Santa Barbara, California, USA, 2001, pp.102–113.

Download references

Author information

Authors and Affiliations

  1. College of Information Science and Engineering, Northeastern University, Shenyang, 110004, China

    Bin Wang, Xiao-Chun Yang, Guo-Ren Wang & Ge Yu

  2. Department of Computer Science, The Hong Kong University of Science and Technology, Hong Kong S.A.R., China

    Lei Chen

  3. Department of Computer Science, University of Vermont, Vermont, U.S.A.

    X. Sean Wang

  4. Department of Computer Science, The University of New South Wales, New South Wales, Australia

    Xue-Min Lin

Authors
  1. Bin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiao-Chun Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guo-Ren Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ge Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Lei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. X. Sean Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Xue-Min Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bin Wang.

Additional information

Supported by the Program for New Century Excellent Talents in Universities (Grant No. NCET-06-0290), the National Natural Science Foundation of China (Grant Nos. 60503036, and 60773221), the National High-Tech Development 863 Program of China (Grant No. 2006AA09Z139), and the Fok Ying Tong Education Foundation Award (Grant No. 104027).

Electronic supplementary material

Below is the link to the electronic supplementary material.

(PDF 97.6 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, B., Yang, XC., Wang, GR. et al. Continually Answering Constraint k-NN Queries in Unstructured P2P Systems. J. Comput. Sci. Technol. 23, 538–556 (2008). https://doi.org/10.1007/s11390-008-9151-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-008-9151-x

Keywords

Search

Navigation