{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T00:18:31Z","timestamp":1775780311785,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"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":[[2008,6,9]]},"DOI":"10.1145\/1376616.1376623","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"43-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":231,"title":["Scalable network distance browsing in spatial databases"],"prefix":"10.1145","author":[{"given":"Hanan","family":"Samet","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Jagan","family":"Sankaranarayanan","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Houman","family":"Alborzi","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.41.0025"},{"key":"e_1_3_2_1_2_1","first-page":"865","volume-title":"VLDB'05","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'05 , pp. 865 -- 876 , Trondheim , Norway, Sep . 2005 . H.-J. Cho and C.-W. Chung. An efficient and scalable approach to CNN queries in a road network. In VLDB'05, pp. 865--876, Trondheim, Norway, Sep. 2005."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.16"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/102782.102788"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224297"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/358728.358741"},{"key":"e_1_3_2_1_8_1","first-page":"156","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 , pp. 156 -- 165 , Vancouver, Canada , Jan. 2005 . A. V. Goldberg and C. Harrelson. Computing the shortest path: A* search meets graph theory. In SODA'05, pp. 156--165, Vancouver, Canada, Jan. 2005."},{"key":"e_1_3_2_1_9_1","first-page":"136","volume-title":"ACM GIS'94","author":"Henrich A.","year":"1994","unstructured":"A. Henrich . A distance-scan algorithm for spatial access structures . In ACM GIS'94 , pp. 136 -- 143 , Gaithersburg, MD , Dec. 1994 . A. Henrich. A distance-scan algorithm for spatial access structures. In ACM GIS'94, pp. 136--143, Gaithersburg, MD, Dec. 1994."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/320248.320255"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/647222.718741"},{"key":"e_1_3_2_1_12_1","first-page":"894","volume-title":"VLDB'06","author":"Hu H.","year":"2006","unstructured":"H. Hu , D. L. Lee , and V. C. S. Lee . Distance indexing on road networks . In VLDB'06 , pp. 894 -- 905 , Seoul, Korea , Sep. 2006 . H. Hu, D. L. Lee, and V. C. S. Lee. Distance indexing on road networks. In VLDB'06, pp. 894--905, Seoul, Korea, Sep. 2006."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1979.4766900"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.687976"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316762"},{"key":"e_1_3_2_1_16_1","first-page":"33","volume-title":"STDBM'04","author":"Kolahdouzan M. R.","year":"2004","unstructured":"M. R. Kolahdouzan and C. Shahabi . Continuous k-nearest neighbor queries in spatial network databases . In STDBM'04 , pp. 33 -- 40 , Toronto, Canada , Aug. 2004 . M. R. Kolahdouzan and C. Shahabi. Continuous k-nearest neighbor queries in spatial network databases. In STDBM'04, pp. 33--40, Toronto, Canada, Aug. 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700368527"},{"key":"e_1_3_2_1_18_1","volume-title":"A computer oriented geodetic data base and a new technique in file sequencing. Tech. report","author":"Morton G. M.","year":"1966","unstructured":"G. M. Morton . A computer oriented geodetic data base and a new technique in file sequencing. Tech. report , IBM Ltd ., Ottawa, Canada, 1966 . G. M. Morton. A computer oriented geodetic data base and a new technique in file sequencing. Tech. report, IBM Ltd., Ottawa, Canada, 1966."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38744"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90027-8"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315520"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0146-664X(80)90118-5"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1981.4767054"},{"key":"e_1_3_2_1_25_1","volume-title":"Morgan-Kaufmann","author":"Samet H.","year":"2006","unstructured":"H. Samet . Foundations of Multidimensional and Metric Data Structures . Morgan-Kaufmann , San Francisco , 2006 . H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann, San Francisco, 2006."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/282957.282966"},{"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.1016\/0734-189X(87)90045-4"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/02693799008941534"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025153016110"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_69"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.32.1.65"}],"event":{"name":"SIGMOD\/PODS '08: SIGMOD\/PODS '08 - International Conference on Management of Data","location":"Vancouver Canada","acronym":"SIGMOD\/PODS '08","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2008 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376623","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1376616.1376623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:18Z","timestamp":1750258038000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":32,"alternative-id":["10.1145\/1376616.1376623","10.1145\/1376616"],"URL":"https:\/\/doi.org\/10.1145\/1376616.1376623","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}