{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T17:13:08Z","timestamp":1774631588904,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Hong Kong General Research Fund","award":["14200817"],"award-info":[{"award-number":["14200817"]}]},{"name":"Hong Kong AoE\/P-404\/18, Innovation and Technology Fund","award":["ITS\/310\/18, ITP\/047\/19LP"],"award-info":[{"award-number":["ITS\/310\/18, ITP\/047\/19LP"]}]},{"name":"Centre for Perceptual and Interactive Intelligence (CPII) Limited under the Innovation and Technology Fund"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3459245","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"313-325","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators"],"prefix":"10.1145","author":[{"given":"Zitong","family":"Chen","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]},{"given":"Ada Wai-Chee","family":"Fu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]},{"given":"Minhao","family":"Jiang","sequence":"additional","affiliation":[{"name":"TuSimple, San Diego, CA, USA"}]},{"given":"Eric","family":"Lo","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]},{"given":"Pengfei","family":"Zhang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973198.14"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_2_5_1","volume-title":"Werneck","author":"Bast Hannah","year":"2016","unstructured":"Hannah Bast , Daniel Delling , Andrew V. Goldberg , Matthias M\u00fcller-Hannemann , Thomas Pajor , Peter Sanders , Dorothea Wagner , and Renato F . Werneck . 2016 . Route Planning in Transportation Networks. Algorithm Engineering , 19--80. Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias M\u00fcller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F. Werneck. 2016. Route Planning in Transportation Networks. Algorithm Engineering, 19--80."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/074\/07"},{"key":"e_1_3_2_2_7_1","volume-title":"Proceedings of the Latin American Symposium on Theoretical Informatics. 88--94","author":"Michael","unstructured":"Michael A. Bender and Martin Farach-Colton. 2000. The LCA Problem Revisited . In Proceedings of the Latin American Symposium on Theoretical Informatics. 88--94 . Michael A. Bender and Martin Farach-Colton. 2000. The LCA Problem Revisited. In Proceedings of the Latin American Symposium on Theoretical Informatics. 88--94."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.03.008"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0274-x"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010016"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213888"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516417"},{"key":"e_1_3_2_2_13_1","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 937--946","author":"Cohen Edith","year":"2002","unstructured":"Edith Cohen , Eran Halperin , Haim Kaplan , and Uri Zwick . 2002 . Reachability and Distance Queries via 2-hop Labels . In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 937--946 . Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. 2002. Reachability and Distance Queries via 2-hop Labels. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 937--946."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718537"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536346"},{"key":"e_1_3_2_2_17_1","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 210--219","author":"Gavoille Cyril","year":"2001","unstructured":"Cyril Gavoille , David Peleg , Stephane Perennes , and Ran Raz . 2001 . Distance Labeling in Graphs . In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 210--219 . Cyril Gavoille, David Peleg, Stephane Perennes, and Ran Raz. 2001. Distance Labeling in Graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 210--219."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"e_1_3_2_2_19_1","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 156--165","author":"Goldberg Andrew V","year":"2005","unstructured":"Andrew V Goldberg and Chris Harrelson . 2005 . Computing the Shortest Path: A Search Meets Graph Theory . In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 156--165 . Andrew V Goldberg and Chris Harrelson. 2005. Computing the Shortest Path: A Search Meets Graph Theory. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 156--165."},{"key":"e_1_3_2_2_20_1","first-page":"100","article-title":"Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks","volume":"4","author":"Gutman Ronald J","year":"2004","unstructured":"Ronald J Gutman . 2004 . Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks . Algorithm Engineering and Experimentation , Vol. 4 , 100 -- 111 . Ronald J Gutman. 2004. Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. Algorithm Engineering and Experimentation, Vol. 4, 100--111.","journal-title":"Algorithm Engineering and Experimentation"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732993"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2947618.2947623"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00107"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319877"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164141"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11764298_29"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196913"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377371"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1379811.1379818"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_51"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.57"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_15"},{"key":"e_1_3_2_2_34_1","volume-title":"Proceedings of the IEEE Symposium on Foundations of Computer Science. 703--712","author":"Yu Wei","year":"2009","unstructured":"Christian. Sommer, Elad. Verbin, and Wei Yu . 2009 . Distance Oracle for Sparse Graphs . In Proceedings of the IEEE Symposium on Foundations of Computer Science. 703--712 . Christian. Sommer, Elad. Verbin, and Wei Yu. 2009. Distance Oracle for Sparse Graphs. In Proceedings of the IEEE Symposium on Foundations of Computer Science. 703--712."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380798"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342265"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-61350-053-8.ch009"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516418"},{"key":"e_1_3_2_2_39_1","first-page":"399","article-title":"Distributed Shortest Path Query Processing on Dynamic Road Networks","volume":"26","author":"Zhang Dongxiang","year":"2017","unstructured":"Dongxiang Zhang , Dingyu Yang , Yuan Wang , Kian Lee Tan , Jian Cao , and Heng Tao Shen . 2017 . Distributed Shortest Path Query Processing on Dynamic Road Networks . Proceedings of the VLDB Endowment , Vol. 26 , 3, 399 -- 419 . Dongxiang Zhang, Dingyu Yang, Yuan Wang, Kian Lee Tan, Jian Cao, and Heng Tao Shen. 2017. Distributed Shortest Path Query Processing on Dynamic Road Networks. Proceedings of the VLDB Endowment, Vol. 26, 3, 399--419.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12079-5_1"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2019.00-69"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487665"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3459245","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3459245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:25:04Z","timestamp":1750195504000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3459245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":42,"alternative-id":["10.1145\/3448016.3459245","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3459245","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}