Encyclopedia of GIS

2017 Edition
| Editors: Shashi Shekhar, Hui Xiong, Xun Zhou

k-NN Search in Time-Dependent Road Networks

  • Ugur DemiryurekEmail author
  • Cyrus Shahabi
Reference work entry
DOI: https://doi.org/10.1007/978-3-319-17885-1_1528

Synonyms

Definition

The ever-growing popularity of online map services and their wide deployment in smartphones and car-navigation systems have led to extensive use of location-based services. One of the most popular classes of such services is k-nearest neighbor (kNN) queries where users search for geographical points of interests (e.g., restaurants) and the corresponding directions and travel times to these locations in road networks. The online nature of these services requires almost instant response time. Accordingly, many algorithms have been developed to speed up kNN search in road networks by using a variety of precomputation techniques. However, all the existing approaches and commercial services for kNN search in road networks make the simplifying assumption that the fastest path between any two nodes in the network is unique by...

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

References

  1. Cho H-J, Chung C-W (2005) An efficient and scalable approach to cnn queries in a road network. In: An efficient and scalable approach to CNN queries in a road network (VLDB’05), Trondheim, pp 865–876Google Scholar
  2. Demiryurek U, Banaei-Kashani F, Shahabi C (2010) Efficient k-nearest neighbor search in time-dependent spatial networks. In: Bringas PG, Hameurlain A, Quirchmayr G (eds) Database and expert systems applications: proceedings of the 21st international conference, part I (DEXA’10), Bilbao, 30 Aug–3 Sept 2010 Springer, Berlin/Heidelberg, pp 432–449Google Scholar
  3. Demiryurek U, Banaei-Kashani F, Shahabi C (2010) Towards k-nearest neighbor search in time-dependent spatial network databases. In: Kikuchi S, Sachdeva S, Bhalla S (eds) Databases in networked information systems: proceedings of the 6th international workshop (DNIS’10), Aizuwakamatsu, 29–31 Mar 2010, pp 296–310Google Scholar
  4. Dreyfus P (1969) An appraisal of some shortest path algorithms. Oper Res 17(3): 395–412. New YorkGoogle Scholar
  5. George B, Kim S, Shekhar S (2007) Spatio-temporal network databases and routing algorithms: a summary of results. In: Proceedings of the 10th international conference on advances in spatial and temporal databases (SSTD’07), Boston, pp 460–477Google Scholar
  6. Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD international conference on management of data (SIGMOD’84), Boston, pp 47–57Google Scholar
  7. Huang X, Jensen CS, Saltenis S (2005) The island approach to nearest neighbor querying in spatial networks. In: Proceedings of the 9th international conference on advances in spatial and temporal databases (SSTD’05), Angra dos Reis, pp 73–90Google Scholar
  8. Huang X, Jensen CS, Lu H, Saltenis S (2007) S-grid: a versatile approach to efficient query processing in spatial networks. In: Proceedings of the 10th international conference on advances in spatial and temporal databases (SSTD’07), Boston, pp 93–111Google Scholar
  9. Kolahdouzan M, Shahabi C (2004) Voronoi-based k nearest neighbor search in spatial networks. In: Proceedings of the thirtieth international conference on very large data bases (VLDB’04), Toronto, vol 30, pp 840–851Google Scholar
  10. Papadias D, Yiu M, Mamoulis N, Tao Y (2008) Nearest neighbor queries in network databases. In: Encyclopedia of GIS. Springer, pp 772–776Google Scholar
  11. Samet H, Sankaranarayanan J, Alborzi H (2008) Scalable network distance browsing in spatial databases. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data (SIGMOD’08), Vancouver, pp 43–54Google Scholar
  12. Zhang D (2008) Fastest-path computation. In: Encyclopedia of GIS. Springer, pp 309–313Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Computer Science DepartmentUniversity of Southern CaliforniaLos AngelesUSA
  2. 2.Information Laboratory (InfoLab), Computer Science DepartmentUniversity of Southern CaliforniaLos AngelesUSA
  3. 3.University of Southern CaliforniaLos AngelesUSA
  4. 4.Integrated Media Systems CenterUniversity of Southern CaliforniaLos AngelesUSA