Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Nearest Neighbor Query in Spatiotemporal Databases

  • Dimitris Papadias
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_244

Synonyms

NN query; NN search

Definition

Given a set of points P in a multidimensional space, the nearest neighbor (NN) of a query point q is the point in P that is closest to q. Similarly, the k nearest neighbor (kNN) set of q consists of the k points in P with the smallest distances from q. In spatial and spatiotemporal databases, the distance is usually defined according to the Euclidean metric, and the dataset P is disk resident. Query algorithms aim at minimizing the processing cost. Other optimization criteria in the case of moving objects (or queries) include the network latency or the number of queries required for keeping the results up-to-date.

Historical Background

Nearest neighbor (NN) search is one of the oldest problems in computer science. Several algorithms and theoretical performance bounds have been devised for exact and approximate processing in main memory [ 1]. In spatial databases, existing algorithms assume that P is indexed by a spatial access method (usually an R-...
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Arya S, Mount D, Netanyahu N, Silverman R, Wu A. An optimal algorithm for approximate nearest neighbor searching. J ACM. 1998;45(6):891–923.MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Beckmann N, Kriegel H, Schneider R, Seeger B. The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1990. p. 322–31.Google Scholar
  3. 3.
    Benetis R, Jensen C, Karciauskas G, Saltenis S. Nearest neighbor and reverse nearest neighbor queries for moving objects. VLDB J. 2006;15(3):229–49.CrossRefGoogle Scholar
  4. 4.
    Bohm C. A cost model for query processing in high dimensional data spaces. ACM Trans Database Syst. 2000;25(2):129–78.MathSciNetCrossRefGoogle Scholar
  5. 5.
    Hjaltason G, Samet H. Distance browsing in spatial databases. ACM Trans Database Syst. 1999;24(2):265–318.CrossRefGoogle Scholar
  6. 6.
    Mouratidis K, Hadjieleftheriou M, Papadias D. Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2005. p. 634–45.Google Scholar
  7. 7.
    Papadias D, Zhang J, Mamoulis N, Tao Y. Query processing in spatial network databases. In: Proceedings of the 29th Conference on Very Large Data Bases; 2003. p. 790–801.CrossRefGoogle Scholar
  8. 8.
    Roussopoulos N, Kelly S, Vincent F. Nearest neighbor queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1995. p. 71–9.Google Scholar
  9. 9.
    Saltenis S, Jensen C, Leutenegger S, Lopez M. Indexing the positions of continuously moving objects. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2000. p. 331–42.Google Scholar
  10. 10.
    Song Z, Roussopoulos N. K-nearest neighbor search for moving query point. In: Proceedings of the 7th International Symposium. Advances in Spatial and Temporal Databases; 2001. p. 79–96.Google Scholar
  11. 11.
    Tao Y, Papadias D. Spatial queries in dynamic environments. ACM Trans Database Syst. 2003;28(2):101–39.CrossRefGoogle Scholar
  12. 12.
    Tao Y, Faloutsos C, Papadias D, Liu B. Prediction and indexing of moving objects with unknown motion patterns. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2004. p. 611–22.Google Scholar
  13. 13.
    Zhang J, Zhu M, Papadias D, Tao Y, Lee D. Location-based spatial queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2003. p. 443–54.Google Scholar
  14. 14.
    Zheng B, Lee D. Semantic caching in location-dependent query processing. In: Proceedings of the 7th International Symposium. Advances in Spatial and Temporal Databases; 2001. p. 97–116.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringHong Kong University of Science and TechnologyKowloonHong Kong

Section editors and affiliations

  • Dimitris Papadias
    • 1
  1. 1.Dept. of Computer Science and Eng.Hong Kong Univ. of Science and TechnologyKowloonHong Kong