Finding the K Nearest Objects over Time Dependent Road Networks

  • Muxi Leng
  • Yajun YangEmail author
  • Junhu Wang
  • Qinghua Hu
  • Xin Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10988)


K nearest neighbor (kNN) search is an important problem and has been well studied on static road networks. However, in real world, road networks are often time-dependent, i.e., the time for traveling through a road always changes over time. Most existing methods for kNN query build various indexes maintaining the shortest distances for some pairs of vertices on static road networks. Unfortunately, these methods cannot be used for the time-dependent road networks because the shortest distances always change over time. To address the problem of kNN query on time-dependent road networks, we propose a novel voronoi-based index in this paper. Moreover, we propose an algorithm for pre-processing time-dependent road networks such that the waiting time is not necessary to be considered. We confirm the efficiency of our method through experiments on real-life datasets.



This work is supported by the grant of the National Natural Science Foundation of China No. 61402323, 61572353 and the Australian Research Council Discovery Grant DP130103051.


  1. 1.
    Chucre, M.R.R.B., do Nascimento, S.M., de Macêdo, J.A.F., Monteiro, J.M., Casanova, M.A.: Taxi, please! A nearest neighbor query in time-dependent road networks. In: MDM, pp. 180–185 (2016)Google Scholar
  2. 2.
    Costa, C.F., Machado, J.C., Nascimento, M.A., de Macêdo, J.A.F.: Aggregate k-nearest neighbors queries in time-dependent road networks. In: SIGSPATIAL, pp. 3–12 (2015)Google Scholar
  3. 3.
    Costa, C.F., Nascimento, M.A., de Macêdo, J.A.F., Machado, J.C.: A*-based solutions for KNN queries with operating time constraints in time-dependent road networks. In: MDM, pp. 23–32 (2014)Google Scholar
  4. 4.
    Cruz, L.A., Lettich, F., Júnior, L.S., Magalhães, R.P., de Macêdo, J.A.F.: Finding the nearest service provider on time-dependent road networks. In: ECML-PKDD, pp. 21–31 (2017)Google Scholar
  5. 5.
    Cruz, L.A., Nascimento, M.A., de Macêdo, J.A.F.: K-nearest neighbors queries in time-dependent road networks. JIDM 3(3), 211–226 (2012)Google Scholar
  6. 6.
    Demiryurek, U., Kashani, F.B., Shahabi, C.: Efficient k-nearest neighbor search in time-dependent spatial networks. In: DEXA, pp. 432–449 (2010)Google Scholar
  7. 7.
    Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205–216 (2008)Google Scholar
  8. 8.
    George, B., Shekhar, S.: Time-aggregated graphs for modeling spatio-temporal networks. J. Data Semant. 11, 191–212 (2006)Google Scholar
  9. 9.
    Hu, H., Lee, D.L., Xu, J.: Fast nearest neighbor search on road networks. In: EDBT, pp. 186–203 (2006)Google Scholar
  10. 10.
    Huang, X., Jensen, C.S., Saltenis, S.: The islands approach to nearest neighbor querying in spatial networks. In: SSTD, pp. 73–90 (2005)CrossRefGoogle Scholar
  11. 11.
    Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: ICDE, p. 10 (2006)Google Scholar
  12. 12.
    Kolahdouzan, M.R., Shahabi, C.: Voronoi-based K nearest neighbor search for spatial network databases. In: VLDB, pp. 840–851 (2004)CrossRefGoogle Scholar
  13. 13.
    Komai, Y., Nguyen, D.H., Hara, T., Nishio, S.: kNN search utilizing index of the minimum road travel time in time-dependent road networks. In: SRDS, pp. 131–137 (2014)Google Scholar
  14. 14.
    Lee, K.C.K., Lee, W., Zheng, B.: Fast object search on road networks. In: EDBT, pp. 1018–1029 (2009)Google Scholar
  15. 15.
    Wei-Kleiner, F.: Finding nearest neighbors in road networks: a tree decomposition method. In: EDBT, pp. 233–240 (2013)Google Scholar
  16. 16.
    Yang, S., Cheema, M.A., Lin, X., Zhang, Y., Zhang, W.: Reverse k nearest neighbors queries and spatial reverse top-k queries. VLDB J. 26(2), 151–176 (2017)CrossRefGoogle Scholar
  17. 17.
    Yang, Y., Gao, H., Yu, J.X., Li, J.: Finding the cost-optimal path with time constraint over time-dependent graphs. Proc. VLDB Endow. 7, 673–684 (2014)CrossRefGoogle Scholar
  18. 18.
    Zheng, Y., Guo, Q., Tung, A.K.H., Wu, S.: Lazylsh: approximate nearest neighbor search for multiple distance functions with a single index. In: SIGMOD, pp. 2023–2037 (2016)Google Scholar
  19. 19.
    Zhong, R., Li, G., Tan, K., Zhou, L.: G-tree: an efficient index for KNN search on road networks. In: CIKM, pp. 39–48 (2013)Google Scholar
  20. 20.
    Zhu, H., Yang, X., Wang, B., Lee, W.: Range-based obstructed nearest neighbor queries. In: SIGMOD, pp. 2053–2068 (2016)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Muxi Leng
    • 1
  • Yajun Yang
    • 1
    Email author
  • Junhu Wang
    • 2
  • Qinghua Hu
    • 1
  • Xin Wang
    • 1
  1. 1.School of Computer Science and TechnologyTianjin UniversityTianjinChina
  2. 2.School of Information and Communication TechnologyGriffith UniversityBrisbaneAustralia

Personalised recommendations