Movatterモバイル変換


[0]ホーム

URL:


Skip to main content

Advertisement

Springer Nature Link
Log in

Nearest Neighbor Query in Spatio-temporal Databases

  • Reference work entry
  • 382Accesses

Definition

Given a set of pointsP in a multi-dimensional space, the nearest neighbor (NN) of a query pointq is the point inP that is closest toq. Similarly, thek nearest neighbor (kNN) set ofq consists of thek points inP with the smallest distances fromq. In spatial and spatio-temporal databases, the distance is usually defined according to the Euclidean metric, and the datasetP 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 thatPis indexed by a spatial access method (usually...

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 264550
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Recommended Reading

  1. Arya S., Mount D., Netanyahu N., Silverman R., and Wu A. An optimal algorithm for approximate nearest neighbor searching. J. ACM, 45(6):891–923, 1998.

    Article MATH MathSciNet  Google Scholar 

  2. Beckmann N., Kriegel H., Schneider R., and Seeger B. The R*-tree: an efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1990, pp. 322–331.

    Google Scholar 

  3. Benetis R., Jensen C., Karciauskas G., and Saltenis S. Nearest neighbor and reverse nearest neighbor queries for moving objects. VLDB J., 15(3):229–249, 2006.

    Article  Google Scholar 

  4. Bohm C. A cost model for query processing in high dimensional data spaces. ACM Trans. Database Sys., 25(2):129–178, 2000.

    Article  Google Scholar 

  5. Hjaltason G. and Samet H. Distance browsing in spatial databases. ACM Trans. Database Sys., 24(2):265–318, 1999.

    Article  Google Scholar 

  6. Mouratidis K., Hadjieleftheriou M., and Papadias D. Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2005, pp. 634–645.

    Google Scholar 

  7. Papadias D., Zhang J., Mamoulis N., and Tao Y. Query processing in spatial network databases. In Proc. of the 29th Conf. on Very Large Databases, 2003, pp. 790–801.

    Google Scholar 

  8. Roussopoulos N., Kelly S., and Vincent F. Nearest Neighbor Queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1995, pp. 71–79.

    Google Scholar 

  9. Saltenis S., Jensen C., Leutenegger S., and Lopez M. Indexing the positions of continuously moving objects. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2000, pp. 331–342.

    Google Scholar 

  10. Song Z., and Roussopoulos N. K-nearest neighbor search for moving query point. In Proc. 7th Int. Symp. Advances in Spatial and Temporal Databases, 2001, pp. 79–96.

    Google Scholar 

  11. Tao Y. and Papadias D. Spatial queries in dynamic environments. ACM Trans. Database Sys., 28(2):101–139, 2003.

    Article  Google Scholar 

  12. Tao Y., Faloutsos C., Papadias D., and Liu B. Prediction and indexing of moving objects with unknown motion patterns. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2004, pp. 611–622.

    Google Scholar 

  13. Zhang J., Zhu M., Papadias D., Tao Y., and Lee D. Location-based spatial queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2003, pp. 443–454.

    Google Scholar 

  14. Zheng B., and Lee D. Semantic caching in location-dependent query processing. In Proc. 7th Int. Symp. Advances in Spatial and Temporal Databases, 2001, pp. 97–116.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hong Kong University of Science and Technology, Hong Kong, China

    Dimitris Papadias

Authors
  1. Dimitris Papadias

    You can also search for this author inPubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computing, Georgia Institute of Technology, 266 Ferst Drive, 30332-0765, Atlanta, GA, USA

    LING LIU (Professor) (Professor)

  2. Database Research Group David R. Cheriton School of Computer Science, University of Waterloo, 200 University Avenue West, N2L 3G1, Waterloo, ON, Canada

    M. TAMER ÖZSU (Professor and Director, University Research Chair) (Professor and Director, University Research Chair)

Rights and permissions

Copyright information

© 2009 Springer Science+Business Media, LLC

About this entry

Cite this entry

Papadias, D. (2009). Nearest Neighbor Query in Spatio-temporal Databases. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_244

Download citation

Publish with us

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 264550
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only


[8]ページ先頭

©2009-2025 Movatter.jp