{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:13:20Z","timestamp":1772043200993,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T00:00:00Z","timestamp":1534118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,8,13]]},"DOI":"10.1145\/3225058.3225061","type":"proceedings-article","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T19:13:06Z","timestamp":1533755586000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["ParaPLL"],"prefix":"10.1145","author":[{"given":"Kun","family":"Qiu","sequence":"first","affiliation":[{"name":"School of Computer Science, Fudan University, Shanghai, China"}]},{"given":"Yuanyang","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Fudan University, Shanghai, China"}]},{"given":"Jing","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Computer Science, Fudan University, Shanghai, China"}]},{"given":"Jin","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science, Fudan University, Shanghai, China"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Fudan University, Shanghai, China"}]},{"given":"Tilman","family":"Wolf","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Massachusetts Amherst, Amherst, Massachusetts"}]}],"member":"320","published-online":{"date-parts":[[2018,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2018. CAIDA. (2018). http:\/\/www.caida.org\/data  2018. CAIDA. (2018). http:\/\/www.caida.org\/data"},{"key":"e_1_3_2_1_2_1","unstructured":"2018. USA Road Network. (2018). http:\/\/www.diag.uniroma1.it\/challenge9\/data\/tiger\/  2018. USA Road Network. (2018). http:\/\/www.diag.uniroma1.it\/challenge9\/data\/tiger\/"},{"key":"e_1_3_2_1_3_1","unstructured":"2018. Xeon X5680 Benchmark. (2018). http:\/\/ranker.sisoftware.net\/  2018. Xeon X5680 Benchmark. (2018). http:\/\/ranker.sisoftware.net\/"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218434"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2634535"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2535444"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_1_10_1","volume-title":"Introduction to algorithms","author":"Cormen Thomas H","unstructured":"Thomas H Cormen . 2009. Introduction to algorithms . MIT press . Thomas H Cormen. 2009. Introduction to algorithms. MIT press."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536346"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213887"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2017.2761777"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39718-2_23"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458274"},{"key":"e_1_3_2_1_22_1","volume-title":"USENIX Annual Technical Conference. 387--401","author":"Wang Kai","year":"2015","unstructured":"Kai Wang , Guoqing (Harry) Xu , Zhendong Su , and Yu David Liu . 2015 . GraphQ: Graph Query Processing with Abstraction Refinement-Scalable and Programmable Analytics over Very Large Graphs on a Single PC .. In USENIX Annual Technical Conference. 387--401 . Kai Wang, Guoqing (Harry) Xu, Zhendong Su, and Yu David Liu. 2015. GraphQ: Graph Query Processing with Abstraction Refinement-Scalable and Programmable Analytics over Very Large Graphs on a Single PC.. In USENIX Annual Technical Conference. 387--401."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807181"},{"key":"e_1_3_2_1_24_1","volume-title":"Network Protocols (ICNP), 2016 IEEE 24th International Conference on. IEEE, 1--10","author":"Xu Qiongwen","year":"2016","unstructured":"Qiongwen Xu , Xu Zhang , Jin Zhao , Xin Wang , and Tilman Wolf . 2016 . Fast shortest-path queries on large-scale graphs . In Network Protocols (ICNP), 2016 IEEE 24th International Conference on. IEEE, 1--10 . Qiongwen Xu, Xu Zhang, Jin Zhao, Xin Wang, and Tilman Wolf. 2016. Fast shortest-path queries on large-scale graphs. In Network Protocols (ICNP), 2016 IEEE 24th International Conference on. IEEE, 1--10."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453934"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-016-0023-z"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0337-7"}],"event":{"name":"ICPP 2018: 47th International Conference on Parallel Processing","location":"Eugene OR USA","acronym":"ICPP 2018","sponsor":["University of Oregon University of Oregon"]},"container-title":["Proceedings of the 47th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225058.3225061","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3225058.3225061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:06Z","timestamp":1750210746000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225058.3225061"}},"subtitle":["Fast Parallel Shortest-path Distance Query on Large-scale Weighted Graphs"],"short-title":[],"issued":{"date-parts":[[2018,8,13]]},"references-count":26,"alternative-id":["10.1145\/3225058.3225061","10.1145\/3225058"],"URL":"https:\/\/doi.org\/10.1145\/3225058.3225061","relation":{},"subject":[],"published":{"date-parts":[[2018,8,13]]},"assertion":[{"value":"2018-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}