{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:18Z","timestamp":1750220358462,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["CH 2464\/1-1"],"award-info":[{"award-number":["CH 2464\/1-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3468791.3468844","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T01:03:56Z","timestamp":1628730236000},"page":"133-144","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Online Landmark-Based Batch Processing of Shortest Path Queries"],"prefix":"10.1145","author":[{"given":"Manuel","family":"Hotz","sequence":"first","affiliation":[{"name":"University of Konstanz, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Theodoros","family":"Chondrogiannis","sequence":"additional","affiliation":[{"name":"University of Konstanz, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonard","family":"W\u00f6rteler","sequence":"additional","affiliation":[{"name":"University of Konstanz, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Grossniklaus","sequence":"additional","affiliation":[{"name":"University of Konstanz, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"volume-title":"Route Planning in Transportation Networks","author":"Bast Hannah","key":"e_1_3_2_1_1_1","unstructured":"Hannah Bast , Daniel Delling , Andrew Goldberg , Matthias M\u00fcller-Hannemann , Thomas Pajor , Peter Sanders , Dorothea Wagner , and Renato\u00a0 F. Werneck . 2016. Route Planning in Transportation Networks . Springer , 19\u201380. https:\/\/doi.org\/10.1007\/978-3-319-49487-6_2 Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias M\u00fcller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato\u00a0F. Werneck. 2016. Route Planning in Transportation Networks. Springer, 19\u201380. https:\/\/doi.org\/10.1007\/978-3-319-49487-6_2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2016.45"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/198"},{"volume-title":"9th DIMACS Implementation Challenge: Shortest Paths","author":"Demetrescu Camil","key":"e_1_3_2_1_4_1","unstructured":"Camil Demetrescu , Andrew\u00a0 V. Goldberg , and David Johnson . 2006. 9th DIMACS Implementation Challenge: Shortest Paths . http:\/\/users.diag.uniroma1.it\/challenge9\/. Accessed: 2021-03-05. Camil Demetrescu, Andrew\u00a0V. Goldberg, and David Johnson. 2006. 9th DIMACS Implementation Challenge: Shortest Paths. http:\/\/users.diag.uniroma1.it\/challenge9\/. Accessed: 2021-03-05."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_6_1","unstructured":"ECML\/PKDD 2015 Competition. 2015. ECML\/PKDD 15: Taxi Trajectory Prediction (I). https:\/\/www.kaggle.com\/c\/pkdd-15-predict-taxi-service-trajectory-i. Accessed: 2021-03-05.  ECML\/PKDD 2015 Competition. 2015. ECML\/PKDD 15: Taxi Trajectory Prediction (I). https:\/\/www.kaggle.com\/c\/pkdd-15-predict-taxi-service-trajectory-i. Accessed: 2021-03-05."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Stefan Edelkamp and Stefan Schr\u00f6dl. 2012. Chapter 2 \u2013 Basic Search Algorithms. In Heuristic Search Stefan Edelkamp and Stefan Schr\u00f6dl (Eds.). Morgan Kaufmann 47\u201387. https:\/\/doi.org\/10.1016\/B978-0-12-372512-7.00002-X  Stefan Edelkamp and Stefan Schr\u00f6dl. 2012. Chapter 2 \u2013 Basic Search Algorithms. In Heuristic Search Stefan Edelkamp and Stefan Schr\u00f6dl (Eds.). Morgan Kaufmann 47\u201387. https:\/\/doi.org\/10.1016\/B978-0-12-372512-7.00002-X","DOI":"10.1016\/B978-0-12-372512-7.00002-X"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223812"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"volume-title":"Proc. Symp. on Discrete Algorithms (SODA). 156\u2013165","author":"V.","key":"e_1_3_2_1_10_1","unstructured":"Andrew\u00a0 V. Goldberg and Chris Harrelson. 2005. Computing the Shortest Path: A* Search Meets Graph Theory . In Proc. Symp. on Discrete Algorithms (SODA). 156\u2013165 . Andrew\u00a0V. Goldberg and Chris Harrelson. 2005. Computing the Shortest Path: A* Search Meets Graph Theory. In Proc. Symp. on Discrete Algorithms (SODA). 156\u2013165."},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. Workshop on Algorithm Engineering and Experiments (ALENEX). https:\/\/doi.org\/10","author":"V.","year":"1972","unstructured":"Andrew\u00a0 V. Goldberg and Renato Werneck. 2005. Computing Point-to-Point Shortest Paths from External Memory . In Proc. Workshop on Algorithm Engineering and Experiments (ALENEX). https:\/\/doi.org\/10 .1137\/1.978161 1972 863.13 Andrew\u00a0V. Goldberg and Renato Werneck. 2005. Computing Point-to-Point Shortest Paths from External Memory. In Proc. Workshop on Algorithm Engineering and Experiments (ALENEX). https:\/\/doi.org\/10.1137\/1.9781611972863.13"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3327964.3328496"},{"key":"e_1_3_2_1_14_1","unstructured":"Kaggle. 2017. New York City Taxi Trip Duration. https:\/\/www.kaggle.com\/c\/nyc-taxi-trip-duration. Accessed: 2021-03-05.  Kaggle. 2017. New York City Taxi Trip Duration. https:\/\/www.kaggle.com\/c\/nyc-taxi-trip-duration. Accessed: 2021-03-05."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.4"},{"key":"e_1_3_2_1_17_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00107"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40235-7_21"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381449"},{"key":"e_1_3_2_1_21_1","unstructured":"OpenStreetMap contributors. 2021. Planet dump retrieved from https:\/\/planet.osm.org. https:\/\/www.openstreetmap.org.  OpenStreetMap contributors. 2021. Planet dump retrieved from https:\/\/planet.osm.org. https:\/\/www.openstreetmap.org."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2015.70"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376623"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_51"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1097064.1097093"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183471.1183506"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687763"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213872"},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. Intl. Conf. on Network Protocols (ICNP). 1\u201310","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 Proc. Intl. Conf. on Network Protocols (ICNP). 1\u201310 . https:\/\/doi.org\/10.1109\/ICNP.2016.7784419 Qiongwen Xu, Xu Zhang, Jin Zhao, Xin Wang, and Tilman Wolf. 2016. Fast shortest-path queries on large-scale graphs. In Proc. Intl. Conf. on Network Protocols (ICNP). 1\u201310. https:\/\/doi.org\/10.1109\/ICNP.2016.7784419"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12079-5_1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2019.00-69"}],"event":{"name":"SSDBM 2021: 33rd International Conference on Scientific and Statistical Database Management","acronym":"SSDBM 2021","location":"Tampa FL USA"},"container-title":["33rd International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3468791.3468844","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3468791.3468844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:21Z","timestamp":1750191441000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3468791.3468844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":33,"alternative-id":["10.1145\/3468791.3468844","10.1145\/3468791"],"URL":"https:\/\/doi.org\/10.1145\/3468791.3468844","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}