{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:51:16Z","timestamp":1759683076129},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,2,14]],"date-time":"2017-02-14T00:00:00Z","timestamp":1487030400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Academic Discipline Project of Shanghai Dianji University","award":["16YSXK04"],"award-info":[{"award-number":["16YSXK04"]}]},{"name":"NExT Search Centre","award":["R-252-300-001-490"],"award-info":[{"award-number":["R-252-300-001-490"]}]},{"name":"China NSF","award":["61272438"],"award-info":[{"award-number":["61272438"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s00778-017-0457-6","type":"journal-article","created":{"date-parts":[[2017,2,14]],"date-time":"2017-02-14T20:17:13Z","timestamp":1487103433000},"page":"399-419","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Distributed shortest path query processing on dynamic road networks"],"prefix":"10.1007","volume":"26","author":[{"given":"Dongxiang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingyu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heng Tao","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,14]]},"reference":[{"key":"457_CR1","doi-asserted-by":"publisher","unstructured":"Abraham, I., Fiat, A., Goldberg, AV., Werneck, RF.: Highway dimension, shortest paths, and provably efficient algorithms. In: SODA, pp. 782\u2013793 (2010)","DOI":"10.1137\/1.9781611973075.64"},{"key":"457_CR2","doi-asserted-by":"publisher","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD, pp. 349\u2013360 (2013)","DOI":"10.1145\/2463676.2465315"},{"issue":"5824","key":"457_CR3","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1126\/science.1137521","volume":"316","author":"H Bast","year":"2007","unstructured":"Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast routing in road networks with transit nodes. Science 316(5824), 566\u2013566 (2007)","journal-title":"Science"},{"key":"457_CR4","doi-asserted-by":"crossref","unstructured":"Bast, H., Delling, D., Goldberg, AV., M\u00fcller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, RF.: Route planning in transportation networks. arXiv:1504.05140v1 [cs.DS] (2015)","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"457_CR5","doi-asserted-by":"publisher","unstructured":"Biem, A., Bouillet, E., Feng, H., Ranganathan, A., Riabov, A., Verscheure, O., Koutsopoulos, H., Moran, C.: Ibm infosphere streams for scalable, real-time, intelligent transportation services. In: SIGMOD, ACM, pp. 1093\u20131104 (2010)","DOI":"10.1145\/1807167.1807291"},{"key":"457_CR6","doi-asserted-by":"publisher","unstructured":"Cheng, J., Ke, Y., Chu, S., Cheng, C.: Efficient processing of distance queries in large graphs: a vertex cover approach. In: SIGMOD, pp. 457\u2013468 (2012)","DOI":"10.1145\/2213836.2213888"},{"key":"457_CR7","doi-asserted-by":"publisher","unstructured":"Delling, D., Werneck, RF.: Faster customization of road networks. In: Experimental Algorithms, Springer, Berlin, pp. 30\u201342 (2013)","DOI":"10.1007\/978-3-642-38527-8_5"},{"key":"457_CR8","doi-asserted-by":"publisher","unstructured":"Delling, D., Goldberg, AV., Pajor, T., Werneck, RF.: Customizable Route Planning. In: Pardalos, PM., Rebennack, S., (Eds.) Proceedings of the 10th International Symposium on Experimental Algorithms (SEA\u201911), Springer, Lecture Notes in Computer Science, vol. 6630, pp. 376\u2013387 (2011)","DOI":"10.1007\/978-3-642-20662-7_32"},{"key":"457_CR9","doi-asserted-by":"publisher","unstructured":"Delling, D., Goldberg, AV., Pajor, T., Werneck, RF.: Customizable route planning in road networks. Transportation Science (2015). doi: 10.1287\/trsc.2014.0579","DOI":"10.1287\/trsc.2014.0579"},{"issue":"4","key":"457_CR10","first-page":"313","volume":"10","author":"Q Fan","year":"2016","unstructured":"Fan, Q., Zhang, D., Wu, H., Tan, K.: A general and parallel platform for mining co-movement patterns over large-scale trajectories. PVLDB 10(4), 313\u2013324 (2016)","journal-title":"PVLDB"},{"key":"457_CR11","doi-asserted-by":"publisher","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In: Experimental Algorithms, pp. 319\u2013333. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"457_CR12","unstructured":"Goldberg, AV., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: SODA, pp. 156\u2013165 (2005)"},{"key":"457_CR13","first-page":"129","volume":"6","author":"AV Goldberg","year":"2006","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for a*: Efficient point-to-point shortest path algorithms. ALENEX 6, 129\u2013143 (2006)","journal-title":"ALENEX"},{"key":"457_CR14","unstructured":"Gonzalez, H., Han, J., Li, X., Myslinska, M., Sondag, JP.: Adaptive fastest path computation on a road network: a traffic mining approach. In: VLDB, VLDB Endowment, pp. 794\u2013805 (2007)"},{"key":"457_CR15","unstructured":"Gonzalez, JE., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: Distributed graph-parallel computation on natural graphs. In: OSDI, pp. 17\u201330 (2012)"},{"key":"457_CR16","doi-asserted-by":"crossref","unstructured":"Guerrero-Ib\u00e1\u00f1ez, A., Flores-Cort\u00e9s, C., Dami\u00e1n-Reyes, P., Andrade-Ar\u00e9chiga, M., Pulido, J.: Emerging technologies for urban traffic management. Tech. rep. (2012)","DOI":"10.5772\/37760"},{"key":"457_CR17","doi-asserted-by":"publisher","unstructured":"Hunter, T., Moldovan, TM., Zaharia, M., Merzgui, S., Ma, J., Franklin, MJ., Abbeel, P., Bayen, AM.: Scaling the mobile millennium system in the cloud. In: SOCC, p. 28 (2011)","DOI":"10.1145\/2038916.2038944"},{"key":"457_CR18","doi-asserted-by":"publisher","unstructured":"Jin, R., Ruan, N., Xiang, Y., Lee, VE.: A highway-centric labeling approach for answering distance queries on large sparse graphs. In: SIGMOD, pp. 445\u2013456 (2012)","DOI":"10.1145\/2213836.2213887"},{"key":"457_CR19","unstructured":"Jin, R., Ruan, N., You, B., Wang, H.: Hub-accelerator: Fast and exact shortest path computation in large social networks. arXiv:1305.0507v1 [cs.SI] (2013)"},{"issue":"1","key":"457_CR20","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"457_CR21","first-page":"83","volume":"6049","author":"T Kieritz","year":"2010","unstructured":"Kieritz, T., Luxen, D., Sanders, P., Vetter, C.: Distributed time-dependent contraction hierarchies. ISEA, LNCS 6049, 83\u201393 (2010)","journal-title":"ISEA, LNCS"},{"issue":"8","key":"457_CR22","first-page":"716","volume":"5","author":"Y Low","year":"2012","unstructured":"Low, Y., Gonzalez, J., Kyrola, A., Bickson, D., Guestrin, C., Hellerstein, J.M.: Distributed graphlab: a framework for machine learning in the cloud. PVLDB 5(8), 716\u2013727 (2012)","journal-title":"PVLDB"},{"key":"457_CR23","doi-asserted-by":"publisher","unstructured":"Malewicz, G., Austern, MH., Bik, AJ., Dehnert, JC., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: SIGMOD, ACM, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"457_CR24","doi-asserted-by":"crossref","unstructured":"Maue, J., Sanders, P., Matijevic, D.: Goal directed shortest path queries using precomputed cluster distances. ACM J. Exp. Algorithmics (2007)","DOI":"10.1007\/11764298_29"},{"issue":"2","key":"457_CR25","first-page":"69","volume":"4","author":"M Rice","year":"2010","unstructured":"Rice, M., Tsotras, V.J.: Graph indexing of road networks for shortest path queries with label restrictions. VLDB 4(2), 69\u201380 (2010)","journal-title":"VLDB"},{"key":"457_CR26","doi-asserted-by":"publisher","unstructured":"Salihoglu, S., Widom, J.: GPS: a graph processing system. In: SSDBM, pp. 22:1\u201322:12 (2013)","DOI":"10.1145\/2484838.2484843"},{"key":"457_CR27","doi-asserted-by":"publisher","unstructured":"Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: ESA, pp. 568\u2013579, Springer, Berlin (2005)","DOI":"10.1007\/11561071_51"},{"key":"457_CR28","doi-asserted-by":"publisher","unstructured":"Thiagarajan, A., Ravindranath, L., LaCurts, K., Madden, S., Balakrishnan, H., Toledo, S., Eriksson, J.: Vtrack: accurate, energy-aware road traffic delay estimation using mobile phones. In: SenSys, pp. 85\u201398, ACM (2009)","DOI":"10.1145\/1644038.1644048"},{"key":"457_CR29","doi-asserted-by":"publisher","unstructured":"Thomsen, JR., Yiu, ML., Jensen, CS.: Effective caching of shortest paths for location-based services. In: SIGMOD, pp. 313\u2013324 (2012)","DOI":"10.1145\/2213836.2213872"},{"key":"457_CR30","doi-asserted-by":"publisher","unstructured":"Wang, Y., Zhang, D., Hu, L., Yang, Y., Lee, LH.: A data-driven and optimal bus scheduling model with time-dependent traffic and demand. IEEE Trans. Intell. Transp. Syst. (99):1\u201310, (2017) doi: 10.1109\/TITS.2016.2644725","DOI":"10.1109\/TITS.2016.2644725"},{"key":"457_CR31","doi-asserted-by":"publisher","unstructured":"Wei, H., Wang, Y., Forman, G., Zhu, Y., Guan, H.: Fast Viterbi map matching with tunable weight functions. In: SIGSPATIAL GIS, pp. 613\u2013616, ACM (2012)","DOI":"10.1145\/2424321.2424430"},{"issue":"5","key":"457_CR32","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. PVLDB 5(5), 406\u2013417 (2012)","journal-title":"PVLDB"},{"issue":"14","key":"457_CR33","first-page":"1981","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Blogel: a block-centric framework for distributed computation on real-world graphs. PVLDB 7(14), 1981\u20131992 (2014)","journal-title":"PVLDB"},{"issue":"14","key":"457_CR34","first-page":"1821","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan, D., Cheng, J., Xing, K., Lu, Y., Ng, W., Bu, Y.: Pregel algorithms for graph connectivity problems with performance guarantees. PVLDB 7(14), 1821\u20131832 (2014)","journal-title":"PVLDB"},{"key":"457_CR35","doi-asserted-by":"publisher","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Effective techniques for message reduction and load balancing in distributed graph computation. In: WWW, pp. 1307\u20131317 (2015)","DOI":"10.1145\/2736277.2741096"},{"key":"457_CR36","doi-asserted-by":"crossref","unstructured":"Yan, D., Cheng, J., \u00d6zsu, MT., Yang, F., Lu, Y., Lui, JCS., Zhang, Q., Ng, W.: Quegel: A general-purpose query-centric framework for querying big graphs. arXiv:1601.06497v1 [cs.DC] (2016)","DOI":"10.14778\/2904483.2904488"},{"issue":"2","key":"457_CR37","first-page":"137","volume":"8","author":"D Yang","year":"2014","unstructured":"Yang, D., Zhang, D., Tan, K., Cao, J., Mou\u00ebl, F.L.: CANDS: continuous optimal navigation via distributed stream processing. PVLDB 8(2), 137\u2013148 (2014)","journal-title":"PVLDB"},{"key":"457_CR38","doi-asserted-by":"publisher","unstructured":"Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., Huang, Y.: T-drive: driving directions based on taxi trajectories. In: SIGSPATIAL GIS, pp. 99\u2013108 , ACM (2010)","DOI":"10.1145\/1869790.1869807"},{"key":"457_CR39","doi-asserted-by":"publisher","unstructured":"Zheng, Y., Liu, Y., Yuan, J., Xie, X.: Urban computing with taxicabs. In: Ubicomp, pp. 89\u201398 (2011)","DOI":"10.1145\/2030112.2030126"},{"key":"457_CR40","doi-asserted-by":"publisher","unstructured":"Zhu, AD., Ma, H., Xiao, X., Luo, S., Tang, Y., Zhou, S.: Shortest path and distance queries on road networks: towards bridging theory and practice. In: SIGMOD, pp. 857\u2013868 (2013)","DOI":"10.1145\/2463676.2465277"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0457-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-017-0457-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0457-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T17:44:54Z","timestamp":1568828694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-017-0457-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,14]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["457"],"URL":"https:\/\/doi.org\/10.1007\/s00778-017-0457-6","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,14]]}}}