{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:09:57Z","timestamp":1775912997932,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Natural Science Foundation of China","award":["61702217, 61702320"],"award-info":[{"award-number":["61702217, 61702320"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3389735","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"665-679","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Distributed Processing of k Shortest Path Queries over Dynamic Road Networks"],"prefix":"10.1145","author":[{"given":"Ziqiang","family":"Yu","sequence":"first","affiliation":[{"name":"Yantai University, Yantai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohui","family":"Yu","sequence":"additional","affiliation":[{"name":"York University, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Koudas","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[{"name":"Wilfrid Laurier University, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifan","family":"Li","sequence":"additional","affiliation":[{"name":"York University, Toronto, Canada and Key Laboratory of Urban Land Resources Monitoring and Simulation, MNR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yueting","family":"Chen","sequence":"additional","affiliation":[{"name":"York University, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingyu","family":"Yang","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Anonymous. 2019. Anonymous technique report. (2019).  Anonymous. 2019. Anonymous technique report. (2019).","DOI":"10.5194\/tc-2019-122-RC1"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2015.02.008"},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of the 21th annual ACM symposium on Theory of computing","author":"Awerbuch Baruch","year":"1989","unstructured":"Baruch Awerbuch . 1989 . Distributed Shortest Paths Algorithms . In Proceedings of the 21th annual ACM symposium on Theory of computing , 1998. 490--500. Baruch Awerbuch. 1989. Distributed Shortest Paths Algorithms. In Proceedings of the 21th annual ACM symposium on Theory of computing, 1998. 490--500."},{"key":"e_1_3_2_2_5_1","first-page":"121","article-title":"Time-Varying Travel Times in Vehicle Routing","volume":"38","author":"Bernhard Fleischmann","year":"2004","unstructured":"Fleischmann Bernhard , Gietz Martin , and Gnutzmann Stefan . 2004 . Time-Varying Travel Times in Vehicle Routing . Transportation Science , Vol. 38 , 2 (2004), 121 -- 255 . Fleischmann Bernhard, Gietz Martin, and Gnutzmann Stefan. 2004. Time-Varying Travel Times in Vehicle Routing. Transportation Science, Vol. 38, 2 (2004), 121--255.","journal-title":"Transportation Science"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/358690.358717"},{"key":"e_1_3_2_2_7_1","volume-title":"Proceedings of the 18th International Conference on Extending Database Technology (EDBT)","author":"Chang Lijun","year":"2015","unstructured":"Lijun Chang , Xuemin Lin , Lu Qin , Jeffrey Xu Yu , and Jian Pei . 2015 . Efficiently computing top-k shortest path join . In Proceedings of the 18th International Conference on Extending Database Technology (EDBT) , 2015. 133--144. Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, and Jian Pei. 2015. Efficiently computing top-k shortest path join. In Proceedings of the 18th International Conference on Extending Database Technology (EDBT), 2015. 133--144."},{"key":"e_1_3_2_2_8_1","unstructured":"DIMACS. 2005. http:\/\/users.diag.uniroma1.it\/challenge9. (2005).  DIMACS. 2005. http:\/\/users.diag.uniroma1.it\/challenge9. (2005)."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055452"},{"key":"e_1_3_2_2_10_1","series-title":"SIAM Journal on computing","volume-title":"Finding the k shortest paths","author":"Eppstein David","year":"1998","unstructured":"David Eppstein . 1998. Finding the k shortest paths . SIAM Journal on computing , Vol. 28 , 2 ( 1998 ), 652--673. David Eppstein. 1998. Finding the k shortest paths. SIAM Journal on computing, Vol. 28, 2 (1998), 652--673."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350248"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00071"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871504"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.117"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188948"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"e_1_3_2_2_17_1","volume-title":"Werneck","author":"Hannah Bast","year":"2016","unstructured":"Bast Hannah , Delling Daniel , Goldberg Andrew , Muller-Hannemann Matthias , Pajor Thomas , Sanders Peter , Wagner Dorothea , and Renato F . Werneck . 2016 . Route Planning in Transportation Networks. Algorithm Engineering ( 2016), 19--80. Bast Hannah, Delling Daniel, Goldberg Andrew, Muller-Hannemann Matthias, Pajor Thomas, Sanders Peter, Wagner Dorothea, and Renato F. Werneck. 2016. Route Planning in Transportation Networks. Algorithm Engineering (2016), 19--80."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290682"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959899"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120406"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2773492"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3225058.3225061"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/IESM.2015.7380229"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2002.993520"},{"key":"e_1_3_2_2_25_1","unstructured":"Apache Storm. 2019. http:\/\/storm.apache.org\/.  Apache Storm. 2019. http:\/\/storm.apache.org\/."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735471.2735475"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3204028.3204030"},{"key":"e_1_3_2_2_29_1","volume-title":"Auction-Based Order Dispatch and Pricing in Ridesharing. In IEEE 35th International Conference on Data Engineering (ICDE)","author":"Zheng Libin","year":"2019","unstructured":"Libin Zheng , Peng Cheng , and Lei Chen . 2019 . Auction-Based Order Dispatch and Pricing in Ridesharing. In IEEE 35th International Conference on Data Engineering (ICDE) , 2019 . Libin Zheng, Peng Cheng, and Lei Chen. 2019. Auction-Based Order Dispatch and Pricing in Ridesharing. In IEEE 35th International Conference on Data Engineering (ICDE), 2019 ."}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389735","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3389735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:44Z","timestamp":1750199924000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":29,"alternative-id":["10.1145\/3318464.3389735","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3389735","relation":{},"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"2020-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}