{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T12:11:40Z","timestamp":1775736700540,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T00:00:00Z","timestamp":1759449600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T00:00:00Z","timestamp":1759449600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62372194"],"award-info":[{"award-number":["62372194"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62172423"],"award-info":[{"award-number":["62172423"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Outstanding Youth Foundation of Hebei Education Department","award":["BJ2021085"],"award-info":[{"award-number":["BJ2021085"]}]},{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["F2024210042"],"award-info":[{"award-number":["F2024210042"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s00778-025-00946-4","type":"journal-article","created":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T07:01:05Z","timestamp":1759474865000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DHL: an efficient hierarchical index for shortest distance querying in time-dependent road networks"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0824-5494","authenticated-orcid":false,"given":"Tangpeng","family":"Dan","sequence":"first","affiliation":[]},{"given":"Xiao","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Bolong","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Xiaofeng","family":"Meng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,3]]},"reference":[{"issue":"5","key":"946_CR1","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"key":"946_CR2","doi-asserted-by":"crossref","unstructured":"Dan, T., Pan, X., Zheng, B., Meng, X.: Double hierarchical labeling shortest distance querying in time-dependent road networks. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE), pp. 2077\u20132089. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00161"},{"issue":"1","key":"946_CR3","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s00453-009-9341-0","volume":"60","author":"D Delling","year":"2011","unstructured":"Delling, D.: Time-dependent sharc-routing. Algorithmica 60(1), 60\u201394 (2011)","journal-title":"Algorithmica"},{"key":"946_CR4","doi-asserted-by":"crossref","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C., Ranganathan, A.: Online computation of fastest path in time-dependent spatial networks. In: International Symposium on Spatial and Temporal Databases, pp. 92\u2013111. Springer (2011)","DOI":"10.1007\/978-3-642-22922-0_7"},{"issue":"1","key":"946_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W., et al.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"4","key":"946_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3626731","volume":"1","author":"M Farhan","year":"2023","unstructured":"Farhan, M., Koehler, H., Ohms, R., Wang, Q.: Hierarchical cut labelling-scaling up distance queries on road networks. Proceedings of the ACM on Management of Data (ACM SIGMOD) 1(4), 1\u201325 (2023)","journal-title":"Proceedings of the ACM on Management of Data (ACM SIGMOD)"},{"key":"946_CR7","doi-asserted-by":"crossref","unstructured":"Fu, A.W.C., Wu, H., Cheng, J., Wong, R.C.W.: Is-label: an independent-set based labeling scheme for point-to-point distance querying. 2013 VLDB 6(6), 457\u2013468 (2013)","DOI":"10.14778\/2536336.2536346"},{"key":"946_CR8","first-page":"156","volume":"5","author":"AV Goldberg","year":"2005","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. SODA 5, 156\u2013165 (2005)","journal-title":"SODA"},{"key":"946_CR9","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for a*: Shortest path algorithms with preprocessing. In: The Shortest Path Problem, pp. 93\u2013139. Citeseer (2006)","DOI":"10.1090\/dimacs\/074\/05"},{"issue":"2","key":"946_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics 4(2), 100\u2013107 (1968)","journal-title":"IEEE transactions on Systems Science and Cybernetics"},{"issue":"5","key":"946_CR11","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1109\/TKDE.2002.1033772","volume":"14","author":"S Jung","year":"2002","unstructured":"Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans. Knowl. Data Eng. 14(5), 1029\u20131046 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"946_CR12","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Analysis of multilevel graph partitioning. In: SC\u201995: Proceedings of the 1995 ACM\/IEEE conference on Supercomputing, pp. 29\u201329. IEEE (1995)","DOI":"10.1145\/224170.224229"},{"issue":"3","key":"946_CR13","first-page":"547","volume":"24","author":"KC Lee","year":"2010","unstructured":"Lee, K.C., Lee, W.C., Zheng, B., Tian, Y.: Road: a new spatial object search framework for road networks. IEEE TKDE 24(3), 547\u2013560 (2010)","journal-title":"IEEE TKDE"},{"key":"946_CR14","doi-asserted-by":"crossref","unstructured":"Li, J., Ni, C., He, D., Li, L., Xia, X., Zhou, X.: Efficient knn query for moving objects on time-dependent road networks. The VLDB Journal pp. 1\u201320 (2022)","DOI":"10.1007\/s00778-022-00758-w"},{"issue":"11","key":"946_CR15","first-page":"1274","volume":"10","author":"L Li","year":"2017","unstructured":"Li, L., Hua, W., Du, X., Zhou, X.: (2017) Minimal on-road time route scheduling on time-dependent graphs. VLDB 10(11), 1274\u20131285 (2017)","journal-title":"VLDB"},{"key":"946_CR16","doi-asserted-by":"crossref","unstructured":"Li, L., Wang, S., Zhou, X.: Time-dependent hop labeling on road network. In: 2019 IEEE ICDE, pp. 902\u2013913. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00085"},{"key":"946_CR17","doi-asserted-by":"crossref","unstructured":"Li, L., Zhang, M., Hua, W., Zhou, X.: Fast query decomposition for batch shortest path processing in road networks. In: 2020 IEEE ICDE, pp. 1189\u20131200. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00107"},{"issue":"3","key":"946_CR18","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00778-018-0499-4","volume":"27","author":"L Li","year":"2018","unstructured":"Li, L., Zheng, K., Wang, S., Hua, W., Zhou, X.: Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory. VLDB J. 27(3), 321\u2013345 (2018)","journal-title":"VLDB J."},{"key":"946_CR19","doi-asserted-by":"crossref","unstructured":"Li, Z., Chen, L., Wang, Y.: G*-tree: An efficient spatial index on road networks. In: 2019 IEEE ICDE, pp. 268\u2013279. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00032"},{"issue":"2","key":"946_CR20","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1002\/net.20438","volume":"59","author":"G Nannicini","year":"2012","unstructured":"Nannicini, G., Delling, D., Schultes, D., Liberti, L.: Bidirectional a* search on time-dependent road networks. Networks 59(2), 240\u2013251 (2012)","journal-title":"Networks"},{"key":"946_CR21","doi-asserted-by":"crossref","unstructured":"Ouyang, D., Qin, L., Chang, L., Lin, X., Zhang, Y., Zhu, Q.: When hierarchy meets 2-hop-labeling: Efficient shortest distance queries on road networks. In: 2018 ACM SIGMOD, pp. 709\u2013724 (2018)","DOI":"10.1145\/3183713.3196913"},{"issue":"6","key":"946_CR22","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1007\/s00778-023-00789-x","volume":"32","author":"D Ouyang","year":"2023","unstructured":"Ouyang, D., Wen, D., Qin, L., Chang, L., Lin, X., Zhang, Y.: When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks. VLDB J. 32(6), 1263\u20131287 (2023)","journal-title":"VLDB J."},{"issue":"5","key":"946_CR23","doi-asserted-by":"publisher","first-page":"602","DOI":"10.14778\/3377369.3377371","volume":"13","author":"D Ouyang","year":"2020","unstructured":"Ouyang, D., Yuan, L., Qin, L., Chang, L., Zhang, Y., Lin, X.: Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees. Proceedings of the VLDB Endowment 13(5), 602\u2013615 (2020)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"8","key":"946_CR24","first-page":"1506","volume":"24","author":"X Pan","year":"2011","unstructured":"Pan, X., Xu, J., Meng, X.: Protecting location privacy against location-dependent attacks in mobile services. IEEE TKDE 24(8), 1506\u20131519 (2011)","journal-title":"IEEE TKDE"},{"key":"946_CR25","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: 2003 VLDB, pp. 802\u2013813 (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"946_CR26","doi-asserted-by":"crossref","unstructured":"Qiu, Y.X., Wen, D., Qin, L., Li, W., Li, R.H., Ying, Z., et\u00a0al.: Efficient shortest path counting on large road networks. Proceedings of the VLDB Endowment (2022)","DOI":"10.14778\/3547305.3547315"},{"key":"946_CR27","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: 2008 ACM SIGMOD, pp. 43\u201354. ACM (2008)","DOI":"10.1145\/1376616.1376623"},{"key":"946_CR28","doi-asserted-by":"crossref","unstructured":"Shen, B., Zhao, Y., Li, G., Zheng, W., Qin, Y., Yuan, B., Rao, Y.: V-tree: Efficient knn search on moving objects with road-network constraints. In: 2017 IEEE ICDE, pp. 609\u2013620. IEEE (2017)","DOI":"10.1109\/ICDE.2017.115"},{"issue":"11","key":"946_CR29","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.14778\/3342263.3342265","volume":"12","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Li, G., Tang, N.: Querying shortest paths on time dependent road networks. Proceedings of the VLDB Endowment 12(11), 1249\u20131261 (2019)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"946_CR30","doi-asserted-by":"crossref","unstructured":"Wei, F.: Tedi: efficient shortest path query answering on graphs. In: Graph Data Management: Techniques and Applications, pp. 214\u2013238. IGI Global (2012)","DOI":"10.4018\/978-1-61350-053-8.ch009"},{"key":"946_CR31","doi-asserted-by":"crossref","unstructured":"Wei, V.J., Wong, R.C.W., Long, C.: Architecture-intact oracle for fastest path and time queries on dynamic spatial networks. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 1841\u20131856 (2020)","DOI":"10.1145\/3318464.3389718"},{"issue":"3","key":"946_CR32","first-page":"686","volume":"15","author":"J Zhang","year":"2021","unstructured":"Zhang, J., Yuan, L., Li, W., Qin, L., Zhang, Y.: (2021) Efficient label-constrained shortest path queries on road networks: a tree decomposition approach. VLDB 15(3), 686\u2013698 (2021)","journal-title":"VLDB"},{"key":"946_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, J., Yuan, L., Li, W., Qin, L., Zhang, Y., Zhang, W.: Label-constrained shortest path query processing on road networks. The VLDB Journal pp. 1\u201325 (2023)","DOI":"10.1007\/s00778-023-00825-w"},{"key":"946_CR34","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Mao, R., Chao, P., Zhou, X.: Dynamic hub labeling for road networks. In: 2021 IEEE ICDE, pp. 336\u2013347. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00036"},{"key":"946_CR35","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Zhou, X.: Efficient 2-hop labeling maintenance in dynamic small-world networks. In: 2021 IEEE ICDE, pp. 133\u2013144. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00019"},{"key":"946_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Zhou, X.: An experimental evaluation and guideline for path finding in weighted dynamic network. VLDB (2021) 14(11), 2127\u20132140 (2021)","DOI":"10.14778\/3476249.3476267"},{"key":"946_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X.: Hub labeling for shortest path counting. In: 2020 ACM SIGMOD, pp. 1813\u20131828 (2020)","DOI":"10.1145\/3318464.3389737"},{"key":"946_CR38","doi-asserted-by":"crossref","unstructured":"Zheng, B., Bi, L., Cao, J., Chai, H., Fang, J., Chen, L., Gao, Y., Zhou, X., Jensen, C.S.: Speaknav: voice-based route description language understanding for template-driven path search. 2021 VLDB 14(12), 3056\u20133068 (2021)","DOI":"10.14778\/3476311.3476383"},{"key":"946_CR39","doi-asserted-by":"crossref","unstructured":"Zheng, B., Huang, C., Jensen, C.S., Chen, L., Hung, N.Q.V., Liu, G., Li, G., Zheng, K.: Online trichromatic pickup and delivery scheduling in spatial crowdsourcing. In: 2020 IEEE ICDE, pp. 973\u2013984. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00089"},{"issue":"8","key":"946_CR40","first-page":"2175","volume":"27","author":"R Zhong","year":"2015","unstructured":"Zhong, R., Li, G., Tan, K.L., Zhou, L., Gong, Z.: G-tree: an efficient and scalable index for spatial search on road networks. IEEE TKDE 27(8), 2175\u20132189 (2015)","journal-title":"IEEE TKDE"},{"key":"946_CR41","doi-asserted-by":"crossref","unstructured":"Zhou, X., Zhang, M., Li, L., Zhou, X.: Scalable distance labeling maintenance and construction for dynamic small-world networks. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE), pp. 4573\u20134585. IEEE (2024)","DOI":"10.1109\/ICDE60146.2024.00348"},{"key":"946_CR42","doi-asserted-by":"crossref","unstructured":"Zhou, X., Zhang, M., Li, L., Zhou, X.: High throughput shortest distance query processing on large dynamic road networks. In: 2025 IEEE 41st International Conference on Data Engineering (ICDE), pp. 1166\u20131179. IEEE Computer Society (2025)","DOI":"10.1109\/ICDE65448.2025.00092"},{"issue":"01","key":"946_CR43","first-page":"670","volume":"16","author":"H Zhu","year":"2023","unstructured":"Zhu, H., Liu, W., Yin, J., Xu, J., Lee, W.C.: Towards keyword-based geo-social group query services. IEEE Trans. Serv. Comput. 16(01), 670\u2013683 (2023)","journal-title":"IEEE Trans. Serv. Comput."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00946-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-025-00946-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00946-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T11:30:40Z","timestamp":1775734240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-025-00946-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,3]]},"references-count":43,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["946"],"URL":"https:\/\/doi.org\/10.1007\/s00778-025-00946-4","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,3]]},"assertion":[{"value":"2 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2026","order":6,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":7,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original version of this article has been corrected to fix an error in the affiliation order and to remove incorrect spacing between the letters \u2018U\u2019 and \u2018B\u2019 (and \u2018L\u2019 and \u2018B\u2019) throughout the manuscript.","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"69"}}