{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:53:47Z","timestamp":1784840027006,"version":"3.55.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61632016"],"award-info":[{"award-number":["61632016"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61925205"],"award-info":[{"award-number":["61925205"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s00778-021-00705-1","type":"journal-article","created":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T20:41:05Z","timestamp":1635799265000},"page":"507-528","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["RNE: computing shortest paths using road network embedding"],"prefix":"10.1007","volume":"31","author":[{"given":"Tianyu","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuai","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengliang","family":"Chai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1398-0621","authenticated-orcid":false,"given":"Guoliang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,1]]},"reference":[{"issue":"6","key":"705_CR1","first-page":"492","volume":"9","author":"T Abeywickrama","year":"2016","unstructured":"Abeywickrama, T., Cheema, M.A., Taniar, D.: K-nearest neighbors on road networks: a journey in experimentation and in-memory implementation. VLDB 9(6), 492\u2013503 (2016)","journal-title":"VLDB"},{"key":"705_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A hub-based labeling algorithm for shortest paths in road networks. In: International symposium on experimental algorithms. Springer, pp. 230\u2013241 (2011)","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"705_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths. In: European Symposium on Algorithms (2012)","DOI":"10.1007\/978-3-642-33090-2_4"},{"issue":"1","key":"705_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S0097539794285983","volume":"27","author":"Y Aumann","year":"1998","unstructured":"Aumann, Y., Rabani, Y.: An o (log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput. 27(1), 291\u2013301 (1998)","journal-title":"SIAM J. Comput."},{"key":"705_CR5","doi-asserted-by":"crossref","unstructured":"Bast, H., Delling, D., Goldberg, A., M\u00fcller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route planning in transportation networks. In: Algorithm engineering, pp. 19\u201380 (2016)","DOI":"10.1007\/978-3-319-49487-6_2"},{"issue":"11","key":"705_CR6","doi-asserted-by":"publisher","first-page":"2409","DOI":"10.1162\/089976601753195969","volume":"13","author":"W Bialek","year":"2001","unstructured":"Bialek, W., Nemenman, I., Tishby, N.: Predictability, complexity, and learning. Neural Comput. 13(11), 2409\u20132463 (2001)","journal-title":"Neural Comput."},{"issue":"1\u20132","key":"705_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BF02776078","volume":"52","author":"J Bourgain","year":"1985","unstructured":"Bourgain, J.: On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math. 52(1\u20132), 46\u201352 (1985)","journal-title":"Israel J. Math."},{"key":"705_CR8","doi-asserted-by":"crossref","unstructured":"Chen, H., Perozzi, B., Hu, Y., Skiena, S.: Harp: Hierarchical representation learning for networks. In: Proceedings of the AAAI conference on artificial intelligence (2018)","DOI":"10.1609\/aaai.v32i1.11849"},{"issue":"7","key":"705_CR9","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.jpdc.2012.02.007","volume":"73","author":"D Delling","year":"2013","unstructured":"Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.: PHAST: hardware-accelerated shortest path trees. J. Parallel Distrib. Comput. 73(7), 940\u2013952 (2013)","journal-title":"J. Parallel Distrib. Comput."},{"key":"705_CR10","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.F.: PHAST: hardware-accelerated shortest path trees. In: IPDPS (2011)","DOI":"10.1109\/IPDPS.2011.89"},{"key":"705_CR11","unstructured":"Deza, M.M., Laurent, M.: Geometry of cuts and metrics. Algorithms and combinatorics 15, pp. 1-587 ISBN 978-3-540-61611-5, Springer (1997)"},{"key":"705_CR12","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: International workshop on experimental and efficient algorithms, pp. 319\u2013333 (2008)","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"705_CR13","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Schieferdecker, D.: Heuristic contraction hierarchies with approximation guarantee. In: Third annual symposium on combinatorial search (2010)","DOI":"10.1609\/socs.v1i1.18161"},{"key":"705_CR14","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: SODA, pp. 156\u2013165. Society for Industrial and Applied Mathematics (2005)"},{"key":"705_CR15","unstructured":"Goldberg, A.V., Werneck, R.F.F.: Computing point-to-point shortest paths from external memory. In: ALENEX\/ANALCO, pp. 26\u201340 (2005)"},{"key":"705_CR16","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: Node2vec: scalable feature learning for networks. In: KDD, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"issue":"2","key":"705_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00493-004-0015-x","volume":"24","author":"A Gupta","year":"2004","unstructured":"Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Cuts, trees and l1-embeddings of graphs. Combinatorica 24(2), 233\u2013269 (2004)","journal-title":"Combinatorica"},{"key":"705_CR18","doi-asserted-by":"publisher","unstructured":"Haitao, Y., Guoliang, Li.: A survey of traffic prediction: from spatio-temporal data to intelligent Transportation. Data. Sci. Eng. 6(1), 63-85 (2021). https:\/\/doi.org\/10.1007\/s41019-020-00151-z","DOI":"10.1007\/s41019-020-00151-z"},{"key":"705_CR19","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Analysis of multilevel graph partitioning. In Supercomputing, pp. 29\u201329. IEEE (1995)","DOI":"10.1145\/224170.224229"},{"issue":"2","key":"705_CR20","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01200755","volume":"15","author":"P Klein","year":"1995","unstructured":"Klein, P., Rao, S., Agrawal, A., Ravi, R.: An approximate max-flow min-cut relation for undirected multicommodity flow, with applications. Combinatorica 15(2), 187\u2013202 (1995)","journal-title":"Combinatorica"},{"key":"705_CR21","doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Kr\u00f6ger, P., Kunath, P., Renz, M., Schmidt, T.: Proximity queries in large traffic networks. In: GIS, p.\u00a021. ACM (2007)","DOI":"10.1145\/1341012.1341040"},{"issue":"6","key":"705_CR22","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM (JACM) 46(6), 787\u2013832 (1999)","journal-title":"J. ACM (JACM)"},{"key":"705_CR23","unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G. S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: Advances in neural information processing systems, pp. 3111\u20133119 (2013)"},{"key":"705_CR24","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: SIGMOD, pp. 709\u2013724 (2018)","DOI":"10.1145\/3183713.3196913"},{"key":"705_CR25","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: Online learning of social representations. In: KDD, pp. 701\u2013710. ACM (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"705_CR26","doi-asserted-by":"crossref","unstructured":"Rao, S.: Small distortion and volume preserving embeddings for planar and Euclidean metrics. In Proceedings of the fifteenth annual symposium on Computational geometry, pp. 300\u2013306. ACM (1999)","DOI":"10.1145\/304893.304983"},{"key":"705_CR27","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD, pp. 43\u201354. ACM (2008)","DOI":"10.1145\/1376616.1376623"},{"issue":"8","key":"705_CR28","first-page":"1158","volume":"22","author":"J Sankaranarayanan","year":"2010","unstructured":"Sankaranarayanan, J., Samet, H.: Query processing using distance oracles for spatial networks. IEEE TKDE 22(8), 1158\u20131175 (2010)","journal-title":"IEEE TKDE"},{"issue":"3","key":"705_CR29","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1025153016110","volume":"7","author":"C Shahabi","year":"2003","unstructured":"Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica 7(3), 255\u2013273 (2003)","journal-title":"GeoInformatica"},{"key":"705_CR30","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: ICDE, pp. 609\u2013620. IEEE (2017)","DOI":"10.1109\/ICDE.2017.115"},{"key":"705_CR31","doi-asserted-by":"publisher","unstructured":"Shiwen, W., Yuanxing, Z., Chengliang, G., Kaigui, B., Bin, C.: GARG: Anonymous Recommendation of Point-of-Interest in Mobile Networks by Graph Convolution Network. Data. Sci. Eng. 5(4), 433\u2013447 (2020). https:\/\/doi.org\/10.1007\/s41019-020-00135-z","DOI":"10.1007\/s41019-020-00135-z"},{"issue":"2","key":"705_CR32","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/TKDE.2017.2760880","volume":"30","author":"N Ta","year":"2017","unstructured":"Ta, N., Li, G., Zhao, T., Feng, J., Ma, H., Gong, Z.: An efficient ride-sharing framework for maximizing shared route. IEEE Trans. Knowl. Data Eng. 30(2), 219\u2013233 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"705_CR33","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: Large-scale information network embedding. In: WWW. International World Wide Web conferences steering committee, pp. 1067\u20131077 (2015)","DOI":"10.1145\/2736277.2741093"},{"issue":"11","key":"705_CR34","first-page":"1249","volume":"12","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Li, G., Tang, N.: Querying shortest paths on time dependent road networks. VLDB 12(11), 1249\u20131261 (2019)","journal-title":"VLDB"},{"issue":"5","key":"705_CR35","first-page":"406","volume":"5","author":"L Wu","year":"2012","unstructured":"Wu, L., Xiao, X., Deng, D., Cong, G., Zhu, A.D., Zhou, S.: Shortest path and distance queries on road networks: an experimental evaluation. VLDB 5(5), 406\u2013417 (2012)","journal-title":"VLDB"},{"key":"705_CR36","unstructured":"You, J., Ying, R., Leskovec, J.: Position-aware graph neural networks. In: International conference on machine learning, pp. 7134\u20137143. PMLR (2019)"},{"key":"705_CR37","doi-asserted-by":"crossref","unstructured":"Zhong, R., Li, G., Tan, K.-L., Zhou, L.: G-tree: An efficient index for KNN search on road networks. In CIKM, pp. 39\u201348. ACM, 2013","DOI":"10.1145\/2505515.2505749"},{"issue":"8","key":"705_CR38","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"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00705-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-021-00705-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00705-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T08:02:30Z","timestamp":1673683350000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-021-00705-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,1]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["705"],"URL":"https:\/\/doi.org\/10.1007\/s00778-021-00705-1","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,1]]},"assertion":[{"value":"4 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}