Skip to main content

Nearest Neighbor Queries in Network Databases

  • Reference work entry
  • First Online:
Encyclopedia of GIS
  • 195 Accesses

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

Access this chapter

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

References

  • Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD

    Google Scholar 

  • Cho HJ, Chung CW (2005) An efficient and scalable approach to CNN queries in a road network. In: VLDB

    Google Scholar 

  • Dijkstra EW (1959) A note on two problems in connection with graphs. Numeriche Mathematik 1:269–271

    Article  MATH  Google Scholar 

  • Hjaltason G, Samet H (1999) Distance browsing in spatial databases. TODS 24(2):265–318

    Article  Google Scholar 

  • Hu H, Lee DL, Xu J (2006) Fast nearest neighbor search on road networks. In: EDBT

    Google Scholar 

  • Huang X, Jensen CS, Saltenis S (2005) The islands approach to nearest neighbor querying in spatial networks. In: SSTD

    Google Scholar 

  • Jing N, Huang YW, Rundensteiner EA (1998) Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation. TKDE 10(3):409–432

    Google Scholar 

  • Kolahdouzan M, Shahabi C (2004) Voronoi-based K nearest neighbor search for spatial network databases. In: VLDB

    Google Scholar 

  • Kolahdouzan M, Shahabi C (2004) Continuous K-nearest neighbor queries in spatial network databases. In: STDBM

    Google Scholar 

  • Mouratidis K, Yiu ML, Papadias D, Mamoulis N (2006) Continuous nearest neighbor monitoring in road networks. In: VLDB

    Google Scholar 

  • Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: VLDB

    Google Scholar 

  • Shekhar S, Liu D (1997) CCAM: a connectivity-clustered access method for networks and network computations. TKDE 19(1):102–119

    Google Scholar 

  • Shekhar S, Yoo JS (2003) Processing in-route nearest neighbor queries: a comparison of alternative approaches. In: ACM GIS

    Google Scholar 

  • Yiu ML, Mamoulis N, Papadias D (2005) Aggregate nearest neighbor queries in road networks. TKDE 17(6):820–833

    Google Scholar 

  • Yiu ML, Papadias D, Mamoulis N, Tao Y (2006) Reverse nearest neighbors in large graphs. TKDE 18(4): 540–553

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

Papadias, D., Yiu, M.L., Mamoulis, N., Tao, Y. (2017). Nearest Neighbor Queries in Network Databases. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_864

Download citation

Publish with us

Policies and ethics