Abstract
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 is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
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)
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)
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)
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)
Demiryurek, U., Kashani, F.B., Shahabi, C.: Efficient k-nearest neighbor search in time-dependent spatial networks. In: DEXA, pp. 432–449 (2010)
Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205–216 (2008)
George, B., Shekhar, S.: Time-aggregated graphs for modeling spatio-temporal networks. J. Data Semant. 11, 191–212 (2006)
Hu, H., Lee, D.L., Xu, J.: Fast nearest neighbor search on road networks. In: EDBT, pp. 186–203 (2006)
Huang, X., Jensen, C.S., Saltenis, S.: The islands approach to nearest neighbor querying in spatial networks. In: SSTD, pp. 73–90 (2005)
Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: ICDE, p. 10 (2006)
Kolahdouzan, M.R., Shahabi, C.: Voronoi-based K nearest neighbor search for spatial network databases. In: VLDB, pp. 840–851 (2004)
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)
Lee, K.C.K., Lee, W., Zheng, B.: Fast object search on road networks. In: EDBT, pp. 1018–1029 (2009)
Wei-Kleiner, F.: Finding nearest neighbors in road networks: a tree decomposition method. In: EDBT, pp. 233–240 (2013)
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)
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)
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)
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)
Zhu, H., Yang, X., Wang, B., Lee, W.: Range-based obstructed nearest neighbor queries. In: SIGMOD, pp. 2053–2068 (2016)
Acknowledgments
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Leng, M., Yang, Y., Wang, J., Hu, Q., Wang, X. (2018). Finding the K Nearest Objects over Time Dependent Road Networks. In: Cai, Y., Ishikawa, Y., Xu, J. (eds) Web and Big Data. APWeb-WAIM 2018. Lecture Notes in Computer Science(), vol 10988. Springer, Cham. https://doi.org/10.1007/978-3-319-96893-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-96893-3_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-96892-6
Online ISBN: 978-3-319-96893-3
eBook Packages: Computer ScienceComputer Science (R0)