{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:24:29Z","timestamp":1777598669112,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,11,6]],"date-time":"2012-11-06T00:00:00Z","timestamp":1352160000000},"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":[[2012,11,6]]},"DOI":"10.1145\/2424321.2424365","type":"proceedings-article","created":{"date-parts":[[2013,1,8]],"date-time":"2013-01-08T12:47:01Z","timestamp":1357649221000},"page":"339-348","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["HLDB"],"prefix":"10.1145","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"Microsoft Research SVC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Delling","sequence":"additional","affiliation":[{"name":"Microsoft Research SVC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amos","family":"Fiat","sequence":"additional","affiliation":[{"name":"Tel Aviv Univ."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew V.","family":"Goldberg","sequence":"additional","affiliation":[{"name":"Microsoft Research SVC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[{"name":"Microsoft Research SVC"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,11,6]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","first-page":"230","volume-title":"SEA","author":"Abraham I.","year":"2011","unstructured":"I. Abraham , D. Delling , A. V. Goldberg , and R. F. Werneck . A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks . In SEA , volume 6630 of LNCS , pages 230 -- 241 , 2011 . I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck. A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks. In SEA, volume 6630 of LNCS, pages 230--241, 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873665"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1671976"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559907"},{"key":"e_1_3_2_1_7_1","first-page":"865","volume-title":"VLDB","author":"Cho H.-J.","year":"2005","unstructured":"H.-J. Cho and C.-W. Chung . An Efficient and Scalable Approach to CNN Queries in a Road Network . In VLDB , pages 865 -- 876 , 2005 . H.-J. Cho and C.-W. Chung. An Efficient and Scalable Approach to CNN Queries in a Road Network. In VLDB, pages 865--876, 2005."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.89"},{"key":"e_1_3_2_1_10_1","series-title":"LNCS","first-page":"376","volume-title":"SEA","author":"Delling D.","year":"2011","unstructured":"D. Delling , A. V. Goldberg , T. Pajor , and R. F. Werneck . Customizable Route Planning . In SEA , volume 6630 of LNCS , pages 376 -- 387 . Springer , 2011 . D. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck. Customizable Route Planning. In SEA, volume 6630 of LNCS, pages 376--387. Springer, 2011."},{"key":"e_1_3_2_1_11_1","series-title":"OASIcs","first-page":"52","volume-title":"ATMOS","author":"Delling D.","year":"2011","unstructured":"D. Delling , A. V. Goldberg , and R. F. Werneck . Faster Batched Shortest Paths in Road Networks . In ATMOS , volume 20 of OASIcs , pages 52 -- 63 , 2011 . D. Delling, A. V. Goldberg, and R. F. Werneck. Faster Batched Shortest Paths in Road Networks. In ATMOS, volume 20 of OASIcs, pages 52--63, 2011."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"e_1_3_2_1_13_1","series-title":"DIMACS Book","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/074","volume-title":"The Shortest Path Problem: Ninth DIMACS Implementation Challenge","author":"Demetrescu C.","year":"2009","unstructured":"C. Demetrescu , A. V. Goldberg , and D. S. Johnson , editors . The Shortest Path Problem: Ninth DIMACS Implementation Challenge , volume 74 of DIMACS Book . 2009 . C. Demetrescu, A. V. Goldberg, and D. S. Johnson, editors. The Shortest Path Problem: Ninth DIMACS Implementation Challenge, volume 74 of DIMACS Book. 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.27.1.161"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4271\/2008-01-0201"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095694"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_3_2_1_21_1","series-title":"OASIcs","first-page":"88","volume-title":"ATMOS","author":"Geisberger R.","year":"2010","unstructured":"R. Geisberger , D. Luxen , P. Sanders , S. Neubauer , and L. Volker . Fast Detour Computation for Ride Sharing . In ATMOS , volume 14 of OASIcs , pages 88 -- 99 , 2010 . R. Geisberger, D. Luxen, P. Sanders, S. Neubauer, and L. Volker. Fast Detour Computation for Ride Sharing. In ATMOS, volume 14 of OASIcs, pages 88--99, 2010."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/070698774"},{"key":"e_1_3_2_1_24_1","first-page":"156","volume-title":"SODA","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and C. Harrelson . Computing the Shortest Path: A* Search Meets Graph Theory . In SODA , pages 156 -- 165 , 2005 . A. V. Goldberg and C. Harrelson. Computing the Shortest Path: A* Search Meets Graph Theory. In SODA, pages 156--165, 2005."},{"key":"e_1_3_2_1_25_1","first-page":"93","volume-title":"Demetrescu et al. {13}","author":"Goldberg A. V.","unstructured":"A. V. Goldberg , H. Kaplan , and R. F. Werneck . Reach for A*: Shortest Path Algorithms with Preprocessing . In Demetrescu et al. {13} , pages 93 -- 139 . A. V. Goldberg, H. Kaplan, and R. F. Werneck. Reach for A*: Shortest Path Algorithms with Preprocessing. In Demetrescu et al. {13}, pages 93--139."},{"key":"e_1_3_2_1_26_1","first-page":"41","volume-title":"Demetrescu et al. {13}","author":"Hilger M.","unstructured":"M. Hilger , E. K\u00f6hler , R. H. M\u00f6hring , and H. Schilling . Fast Point-to-Point Shortest Path Computations with Arc-Flags . In Demetrescu et al. {13} , pages 41 -- 72 . M. Hilger, E. K\u00f6hler, R. H. M\u00f6hring, and H. Schilling. Fast Point-to-Point Shortest Path Computations with Arc-Flags. In Demetrescu et al. {13}, pages 41--72."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/320248.320255"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.4"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.4271\/2006-01-0811"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315520"},{"key":"e_1_3_2_1_31_1","unstructured":"PTV AG - Planung Transport Verkehr 1979.  PTV AG - Planung Transport Verkehr 1979."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_71"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_61"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1097064.1097093"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.75"},{"issue":"2","key":"e_1_3_2_1_36_1","first-page":"4","volume":"33","author":"Sankaranarayanan J.","year":"2010","unstructured":"J. Sankaranarayanan and H. Samet . Roads Belong in Databases. IEEE Data Engineering Bulletin , 33 ( 2 ): 4 -- 11 , 2010 . J. Sankaranarayanan and H. Samet. Roads Belong in Databases. IEEE Data Engineering Bulletin, 33(2):4--11, 2010.","journal-title":"Roads Belong in Databases. IEEE Data Engineering Bulletin"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687763"},{"key":"e_1_3_2_1_38_1","series-title":"LNCS","first-page":"237","volume-title":"EDBT","author":"Schenkel R.","year":"2004","unstructured":"R. Schenkel , A. Theobald , and G. Weikum . HOPI: An Efficient Connection Index for Complex XML Document Collections . In EDBT , volume 2992 of LNCS , pages 237 -- 255 , 2004 . R. Schenkel, A. Theobald, and G. Weikum. HOPI: An Efficient Connection Index for Complex XML Document Collections. In EDBT, volume 2992 of LNCS, pages 237--255, 2004."}],"event":{"name":"SIGSPATIAL'12: SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems","location":"Redondo Beach California","acronym":"SIGSPATIAL'12","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information","SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"]},"container-title":["Proceedings of the 20th International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2424321.2424365","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2424321.2424365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:44Z","timestamp":1750235744000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2424321.2424365"}},"subtitle":["location-based services in databases"],"short-title":[],"issued":{"date-parts":[[2012,11,6]]},"references-count":37,"alternative-id":["10.1145\/2424321.2424365","10.1145\/2424321"],"URL":"https:\/\/doi.org\/10.1145\/2424321.2424365","relation":{},"subject":[],"published":{"date-parts":[[2012,11,6]]},"assertion":[{"value":"2012-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}