Advertisement

K-Nearest Neighbor Search for Moving Query Point

  • Zhexuan Song
  • Nick Roussopoulos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2121)

Abstract

This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research and real-life applications. The problem assumes that the query point is not static, as in k-nearest neighbor problem, but varies its position over time. In this paper, four different methods are proposed for solving the problem. Discussion about the parameters affecting the performance of the algorithms is also presented. A sequence of experiments with both synthetic and real point data sets are studied. In the experiments, our algorithms always outperform the existing ones by fetching 70% less disk pages. In some settings, the saving can be as much as one order of magnitude.

Keywords

Voronoi Diagram Neighbor Search Initial Search Range Query Query Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Berchtold, B. Ertl, D. Keim, H. Kriegel, and T. Seidl. Fast nearest neighbor search in high-dimensional space. In Proceedings of International Conference on Data Engineering, Orlando, USA, 1998.Google Scholar
  2. 2.
    U. C. Bereau. Tiger(r) topologically integrated geographic encoding and referencing system, 1998.Google Scholar
  3. 3.
    S. Chaudhuri and L. Gravona. Evaluating top-k selection queries. In Proceedings of International Conference on Very Large Database, Edinburgh, Scotland, 1999.Google Scholar
  4. 4.
    A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos. Closest pair queries in spatial databases. In Proceedings of ACM SIGMOD International Conference on Management of Data, Dallas, USA, 2000.Google Scholar
  5. 5.
    M. de Berg, M. van Dreveld, M. Overmars, and O. Schwarzkop. Computational Geometry: Algorithms and Applications. Springer-Verlag, 1997.Google Scholar
  6. 6.
    U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy. Advances in Knowledge Discovery and Data Mining. AAAI Press/MIT Press, 1996.Google Scholar
  7. 7.
    V. Gaede and O. Guenther. Multidimensional access methods. ACM Computer Surveys, 30, 1998.Google Scholar
  8. 8.
    T. Kanungu, D. Mount, N. Netanyahu, C. Piatko, R. Silverman, and A. Wu. Computing nearest neighbors for moving points and applications to clustering. In Proceedings of 10th ACM-SIAM Symposium on Discrete Algorithms, 1999.Google Scholar
  9. 9.
    F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas. Fast nearest neighbor search in medical image databases. In Proceedings of International Conference on Very Large Database, Mumbai, India, 1996.Google Scholar
  10. 10.
    H. Kriegel. S3: Similarity search in cad database systems. In Proceedings of ACM SIGMOD International Conference on Management of Data, Tucson, USA, 1997.Google Scholar
  11. 11.
    A. Papadopoulos and Y. Manolopoulos. Performance of nearest neighbor queries in r-trees. In Proceedings of International Conference on Database Theory, Delphi, Greece, 1997.Google Scholar
  12. 12.
    D. Pfoser and C. Jensen. Capturing the uncertainty of moving-object representations. In Proceedings of International Symposium on Large Spatial Databases, 1999.Google Scholar
  13. 13.
    N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proceedings of ACM SIGMOD International Conference on Management of Data, San Jose, USA, 1995.Google Scholar
  14. 14.
    T. Seidl and H. Kriegel. Optimal multi-step k-nearest neighbor search. In Proceedings of ACM SIGMOD International Conference on Management of Data, Seattle, USA, 1998.Google Scholar
  15. 15.
    T. Seidl and H. Kriegel. Efficient user-adaptable similarity search in large multimedia database. In Proceedings of International Conference on Very Large Database, Athens, Greece, Athens.Google Scholar
  16. 16.
    P. Sistla and O. Wolfson. Research issues in moving objects database. In Proceedings of ACM SIGMOD International Conference on Management of Data, Dallas, USA, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Zhexuan Song
    • 1
  • Nick Roussopoulos
    • 2
  1. 1.Department of Computer ScienceUniversity of MarylandCollege ParkUSA
  2. 2.Department of Computer Science & Institute For Advanced Computer StudiesUniversity of MarylandCollege ParkUSA

Personalised recommendations