{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T19:44:17Z","timestamp":1773776657378,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T00:00:00Z","timestamp":1337472000000},"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,5,20]]},"DOI":"10.1145\/2213836.2213887","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"445-456","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":63,"title":["A highway-centric labeling approach for answering distance queries on large sparse graphs"],"prefix":"10.1145","author":[{"given":"Ruoming","family":"Jin","sequence":"first","affiliation":[{"name":"Kent State University, Kent, OH, USA"}]},{"given":"Ning","family":"Ruan","sequence":"additional","affiliation":[{"name":"Kent State University, Kent, OH, USA"}]},{"given":"Yang","family":"Xiang","sequence":"additional","affiliation":[{"name":"Ohio State University, Columbus, OH, USA"}]},{"given":"Victor","family":"Lee","sequence":"additional","affiliation":[{"name":"Kent State University, Kent, OH, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008623.2008645"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873665"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.277767"},{"key":"e_1_3_2_1_4_1","first-page":"689","volume-title":"SODA","author":"Alstrup Stephen","year":"2003","unstructured":"Stephen Alstrup , Philip Bille , and Theis Rauhe . Labeling schemes for small distances in trees . In SODA , pages 689 -- 698 , 2003 . Stephen Alstrup, Philip Bille, and Theis Rauhe. Labeling schemes for small distances in trees. In SODA, pages 689--698, 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775249"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777889"},{"key":"e_1_3_2_1_7_1","volume-title":"April","author":"Bast H.","year":"2007","unstructured":"H. Bast , S. Funke , P. Sanders , and D. Schultes . Fast Routing in Road Networks with Transit Nodes. Science, 316: 566-- , April 2007 . H. Bast, S. Funke, P. Sanders, and D. Schultes. Fast Routing in Road Networks with Transit Nodes. Science, 316:566--, April 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1671976"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516417"},{"key":"e_1_3_2_1_11_1","first-page":"1396","article-title":"On the shortest arborescence of a directed graph","volume":"14","author":"Chu Y. J.","year":"1965","unstructured":"Y. J. Chu and T. H. Liu . On the shortest arborescence of a directed graph . Science Sinica , 14 : 1396 -- 1400 , 1965 . Y. J. Chu and T. H. Liu. On the shortest arborescence of a directed graph. Science Sinica, 14:1396--1400, 1965.","journal-title":"Science Sinica"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_1_13_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","year":"1990","unstructured":"Thomas H. Cormen , Charles E. Leiserson , and Ronald L. Rivest . Introduction to Algorithms . McGraw Hill , 1990 . Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. McGraw Hill, 1990."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718537"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.032"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"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_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788888.1788912"},{"key":"e_1_3_2_1_22_1","volume-title":"SODA '05","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and C. Harrelson . Computing the shortest path: A search meets graph theory . In SODA '05 , 2005 . A. V. Goldberg and C. Harrelson. Computing the shortest path: A search meets graph theory. In SODA '05, 2005."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972863.13"},{"key":"e_1_3_2_1_24_1","volume-title":"VLDB '98","author":"Goldman R.","year":"1998","unstructured":"R. Goldman , N. Shivakumar , S. Venkatasubramanian , and H. Garcia-Molina . Proximity search in databases . In VLDB '98 , 1998 . R. Goldman, N. Shivakumar, S. Venkatasubramanian, and H. Garcia-Molina. Proximity search in databases. In VLDB '98, 1998."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1060"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"e_1_3_2_1_27_1","first-page":"100","volume-title":"ALENEX\/ANALC","author":"Gutman R. J.","year":"2004","unstructured":"R. J. Gutman . Reach-based routing : A new approach to shortest path algorithms optimized for road networks . In ALENEX\/ANALC , pages 100 -- 111 , 2004 . R. J. Gutman. Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In ALENEX\/ANALC, pages 100--111, 2004."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.687976"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.70"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69497-7_12"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_34_1","volume-title":"INFOCOM","author":"Eugene Ng T. S.","year":"2001","unstructured":"T. S. Eugene Ng and H. Zhang . Predicting internet network distance with coordinates-based approaches . In INFOCOM , 2001 . T. S. Eugene Ng and H. Zhang. Predicting internet network distance with coordinates-based approaches. In INFOCOM, 2001."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(200003)33:3%26lt;%26gt;1.0.CO;2-Y"},{"key":"e_1_3_2_1_36_1","first-page":"124","article-title":"Bi-directional search","volume":"6","author":"Pohl I.","year":"1971","unstructured":"I. Pohl . Bi-directional search . Machine Intelligence , 6 : 124 -- 140 , 1971 . I. Pohl. Bi-directional search. Machine Intelligence, 6:124--140, 1971.","journal-title":"Machine Intelligence"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/11590156_13"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376623"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_51"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687763"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_15"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/647225.718933"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1397735.1397737"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989368"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321520"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807181"}],"event":{"name":"SIGMOD\/PODS '12: International Conference on Management of Data","location":"Scottsdale Arizona USA","acronym":"SIGMOD\/PODS '12","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213836.2213887","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213836.2213887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:01Z","timestamp":1750238461000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213836.2213887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,20]]},"references-count":47,"alternative-id":["10.1145\/2213836.2213887","10.1145\/2213836"],"URL":"https:\/\/doi.org\/10.1145\/2213836.2213887","relation":{},"subject":[],"published":{"date-parts":[[2012,5,20]]},"assertion":[{"value":"2012-05-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}