Skip to main content
SpringerLink
Log in

Foundations of Nearest Neighbor Queries in Euclidean Space

  • Reference work entry
  • First Online:
Encyclopedia of GIS

  • 115 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    This work was supported in part by the National Science Foundation under Grants IIS-12-19023 and IIS-13-20791. This chapter and all its figures copyright 2015 by Hanan Samet. All Rights Reserved.

References

  • Aref WG, Samet H (1992) Uniquely reporting spatial objects: yet another operation for comparing spatial data structures. In: Proceedings of the 5th international symposium on spatial data handling, Charleston, pp 178–189

    Google Scholar 

  • Aref WG, Samet H (1994) Hashing by proximity to process duplicates in spatial databases. In: Proceedings of the 3rd international conference on information and knowledge management (CIKM), Gaithersburg, pp 347–354

    Google Scholar 

  • Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1998) An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J ACM 45(6):891–923; Also see proceedings of the 5th annual ACM-SIAM symposium on discrete algorithms, Arlington, pp 573–582, Jan 1994

    Google Scholar 

  • Berchtold S, Böhm C, Keim DA, Kriegel H-P (1997) A cost model for nearest neighbor search in high-dimensional data space. In: Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (PODS), Tucson, pp 78–86

    Google Scholar 

  • Berchtold S, Böhm C, Kriegel H-P (1998) Improving the query performance of high-dimensional index structures by bulk-load operations. In: Schek H-J, Saltor F, Ramos I, Alonso G (eds) Proceedings of the 6th international conference on extending database technology advances in database technology (EDBT’98), Valencia. Lecture Notes in Computer Science, vol 1377. Springer, pp 216–230

    Google Scholar 

  • Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is “nearest neighbor” meaningful? In: Beeri C, Buneman P (eds) Proceedings of the 7th international conference on database theory (ICDT’99), Berlin. Lecture Notes in Computer Science, vol 1540. Springer, pp 217–235

    Google Scholar 

  • Böhm C, Berchtold S, Keim DA (2001) Searching in high-dimensional spaces: index structures for improving the performance of multimedia databases. ACM Comput Surv 33(3):322–373

    Article  Google Scholar 

  • Broder AJ (1990) Strategies for efficient incremental nearest neighbor search. Pattern Recognit 23(1–2):171–178

    Article  Google Scholar 

  • Chávez E, Navarro G, Baeza-Yates R, Marroquín J (2001) Searching in metric spaces. ACM Comput Surv 33(3):273–322

    Article  Google Scholar 

  • Esperança C, Samet H (2002) Experience with SAND/Tcl: a scripting tool for spatial databases. J Vis Lang Comput 13(2):229–255

    Article  Google Scholar 

  • Fukunaga K, Narendra PM (1975) A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans Comput 24(7):750–753

    Article  MATH  Google Scholar 

  • Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD conference, Boston, pp 47–57

    Google Scholar 

  • Henrich A (1994) A distance-scan algorithm for spatial access structures. In: Pissinou N, Makki K (eds) Proceedings of the 2nd ACM workshop on geographic information systems, Gaithersburg, pp 136–143

    Google Scholar 

  • Hjaltason GR, Samet H (1995) Ranking in spatial databases. In: Egenhofer MJ, Herring JR (eds) Advances in spatial databases—4th international symposium (SSD’95), Portland. Lecture Notes in Computer Science, vol 951. Springer, pp 83–95

    Google Scholar 

  • Hjaltason GR, Samet H (1999) Distance browsing in spatial databases. ACM Trans Database Syst 24(2):265–318. Also see University of Maryland Computer Science Technical Report TR–3919, July 1998

    Google Scholar 

  • Hjaltason GR, Samet H (2000) Incremental similarity search in multimedia databases. Computer science technical report TR–4199, University of Maryland, College Park

    Google Scholar 

  • Hjaltason GR, Samet H (2002) Speeding up construction of PMR quadtree-based spatial indexes. VLDB J 11(2):109–137. Also see University of Maryland Computer Science Technical Report TR–4033, July 1999

    Google Scholar 

  • Hjaltason GR, Samet H (2003) Index-driven similarity search in metric spaces. ACM Trans Database Syst 28(4):517–580

    Article  Google Scholar 

  • Kamgar-Parsi B, Kanal LN (1985) An improved branch and bound algorithm for computing k-nearest neighbors. Pattern Recognit Lett 3(1):7–12

    Article  Google Scholar 

  • Larsen S, Kanal LN (1986) Analysis of k-nearest neighbor branch and bound rules. Pattern Recognit Lett 4(2):71–77

    Article  Google Scholar 

  • Lowe D (1999) Object recognition from local scale-invariant features. In: Proceedings of 7th international conference on computer vision, Corfu, vol 2, pp 1150–1157

    Google Scholar 

  • Navarro G (2002) Searching in metric spaces by spatial approximation. VLDB J 11(1):28–46

    Article  Google Scholar 

  • Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: Freytag JC, Lockemann PC, Abiteboul S, Carey MJ, Selinger PG, Heuer A (eds) Proceedings of the 29th international conference on very large data bases (VLDB), Berlin, pp 802–813

    Google Scholar 

  • Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: Proceedings of the ACM SIGMOD conference, San Jose, pp 71–79

    Google Scholar 

  • Samet H (2006) Foundations of multidimensional and metric data structures. Morgan-Kaufmann, San Francisco (Translated to Chinese ISBN 978-7-302-22784-7)

    Google Scholar 

  • Samet H (2008) K-nearest neighbor finding using MaxNearestDist. IEEE Trans Pattern Anal Mach Intell 30(2):243–252

    Article  MathSciNet  Google Scholar 

  • Samet H, Alborzi H, Brabec F, Esperança C, Hjaltason GR, Morgan F, Tanin E (2003) Use of the SAND spatial browser for digital government applications. Commun ACM 46(1):63–66

    Article  Google Scholar 

  • Samet H, Sankaranarayanan J, Alborzi H (2008) Scalable network distance browsing in spatial databases. In: Proceedings of the ACM SIGMOD conference, Vancouver pp 43–54. Also see University of Maryland Computer Science Technical Report TR–4865, April 2007

    Google Scholar 

  • Sankaranarayanan J, Samet H (2009) Distance oracles for spatial networks. In: Proceedings of the 25th IEEE international conference on data engineering, Shanghai, pp 652–663

    Google Scholar 

  • Sankaranarayanan J, Samet H (2010) Query processing using distance oracles for spatial networks. IEEE Trans Knowl Data Eng 22(8):1158–1175. Best papers of ICDE 2009 special issue

    Google Scholar 

  • Sankaranarayanan J, Alborzi H, Samet H (2005) Efficient query processing on spatial networks. In: Proceedings of the 13th ACM international symposium on advances in geographic information systems, Bremen, pp 200–209

    Google Scholar 

  • Sankaranarayanan J, Alborzi H, Samet H (2006) Distance join queries on spatial networks. In: Proceedings of the 14th ACM international symposium on advances in geographic information systems, Arlington, pp 211–218

    Google Scholar 

  • Sankaranarayanan J, Samet H, Alborzi H (2009) Path oracles for spatial networks. PVLDB 2(1):1210–1221. Also see proceedings of the 35th international conference on very large data bases (VLDB)

    Google Scholar 

  • Sellis T, Roussopoulos N, Faloutsos C (1987) The \(R^{+}\)-tree: a dynamic index for multi-dimensional objects. In: Stocker PM, Kent W (eds) Proceedings of the 13th international conference on very large databases (VLDB), Brighton, pp 71–79. Also University of Maryland Computer Science Technical Report TR–1795, 1987

    Google Scholar 

  • Zezula P, Amato G, Dohnal V, Batko M (2006) Similarity search: the metric space approach. Springer, Berlin

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Center for Automation Research, Institute for Advanced Computer Studies, University of Maryland, 20742, College Park, MD, USA

    Hanan Samet

Authors
  1. Hanan Samet
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hanan Samet .

Editor information

Editors and Affiliations

  1. University of Minnesota, Minneapolis, MN, USA

    Shashi Shekhar

  2. Management Science and Information Systems Department, Rutgers Business School, Rutgers, The State University of New Jersey, Newark, NJ, USA

    Hui Xiong

  3. Department of Management Sciences, Tippie College of Business, University of Iowa, Iowa City, IA, USA

    Xun Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

Samet, H. (2017). Foundations of Nearest Neighbor Queries in Euclidean Space. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_1556

Download citation

Publish with us

Policies and ethics

Search

Navigation