{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:08Z","timestamp":1773481928856,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,11,7]],"date-time":"2007-11-07T00:00:00Z","timestamp":1194393600000},"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":[[2007,11,7]]},"DOI":"10.1145\/1341012.1341040","type":"proceedings-article","created":{"date-parts":[[2008,2,8]],"date-time":"2008-02-08T15:34:13Z","timestamp":1202484853000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Proximity queries in large traffic networks"],"prefix":"10.1145","author":[{"given":"Hans-Peter","family":"Kriegel","sequence":"first","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Kunath","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Schmidt","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/88636.88888"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. Int. Conf. on Very Large Databases (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 Proc. Int. Conf. on Very Large Databases (VLDB'05) , 2005 . H.-J. Cho and C.-W. Chung. An efficient and scalable approach to cnn queries in a road network. In Proc. Int. Conf. on Very Large Databases (VLDB'05), 2005."},{"key":"e_1_3_2_1_4_1","volume-title":"Introduction to Algorithms","author":"Corman T. H.","year":"1990","unstructured":"T. H. Corman , C. E. Leiserson , and R. L. Riverst . \" Introduction to Algorithms \". MIT Press , 1990 . T. H. Corman, C. E. Leiserson, and R. L. Riverst. \"Introduction to Algorithms\". MIT Press, 1990."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. Int. Symp. Large SpatialDatabases (SSD'95)","author":"Hjaltason G. R.","year":"1995","unstructured":"G. R. Hjaltason and H Samet . \"Ranking in Spatial Databases\". In Proc. Int. Symp. Large SpatialDatabases (SSD'95) , 1995 . G. R. Hjaltason and H Samet. \"Ranking in Spatial Databases\". In Proc. Int. Symp. Large SpatialDatabases (SSD'95), 1995."},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. Int. Conf. on Very Large Databases (VLDB'06)","author":"Hu H.","year":"2006","unstructured":"H. Hu , D. L. Lee , and V. C. S. Lee . \"Distance Indexing on Road Networks\". In Proc. Int. Conf. on Very Large Databases (VLDB'06) , 2006 . H. Hu, D. L. Lee, and V. C. S. Lee. \"Distance Indexing on Road Networks\". In Proc. Int. Conf. on Very Large Databases (VLDB'06), 2006."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/155271.155273"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. Int. Conf. on Data Engineering (ICDE'92)","author":"Jiang B.","year":"1992","unstructured":"B. Jiang . \"I\/O-Efficiency of Shortest Path Algorithms : An Analysis \". In Proc. Int. Conf. on Data Engineering (ICDE'92) , 1992 . B. Jiang. \"I\/O-Efficiency of Shortest Path Algorithms: An Analysis\". In Proc. Int. Conf. on Data Engineering (ICDE'92), 1992."},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. Int. Conf. on Data Engineering (ICDE'96)","author":"Jung S.","year":"1996","unstructured":"S. Jung and S. Pramanik . \" HiTi Graph Model of Topographical Roadmaps in Navigation Systems \". In Proc. Int. Conf. on Data Engineering (ICDE'96) , 1996 . S. Jung and S. Pramanik. \"HiTi Graph Model of Topographical Roadmaps in Navigation Systems\". In Proc. Int. Conf. on Data Engineering (ICDE'96), 1996."},{"key":"e_1_3_2_1_12_1","volume-title":"In Proc. of STDBM, 2004","author":"Kolahdouzan M.","year":"2004","unstructured":"M. Kolahdouzan and C. Shahabi . \" Continuous K-Nearest Neighbor Queries in Spatial Network Databases \". In In Proc. of STDBM, 2004 , 2004 . M. Kolahdouzan and C. Shahabi. \"Continuous K-Nearest Neighbor Queries in Spatial Network Databases\". In In Proc. of STDBM, 2004, 2004."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316762"},{"key":"e_1_3_2_1_14_1","volume-title":"Expert Database Systems","author":"Kung R.","year":"1986","unstructured":"R. Kung , E. Hanson , Y. Ioannidis , T. Sellis , L. Shapiro , and M. Stonebraker . \" Heuristic Search in Data Base Systems \". Expert Database Systems , 1986 . R. Kung, E. Hanson, Y. Ioannidis, T. Sellis, L. Shapiro, and M. Stonebraker. \"Heuristic Search in Data Base Systems\". Expert Database Systems, 1986."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_13"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365733"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315520"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276319"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. Int. Conf. on Very Large Databases (VLDB'87)","author":"Sellis T. K.","year":"2000","unstructured":"T. K. Sellis , N. Roussopoulos , and C. Faloutsos . \" The R+-Tree: A Dynamic Index for Multi-Dimensional Objects \". In Proc. Int. Conf. on Very Large Databases (VLDB'87) , 2000 . T. K. Sellis, N. Roussopoulos, and C. Faloutsos. \"The R+-Tree: A Dynamic Index for Multi-Dimensional Objects\". In Proc. Int. Conf. on Very Large Databases (VLDB'87), 2000."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025153016110"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/645478.654961"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/647227.719093"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564730"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287395"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872812"},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. Int. Symp. Large Spatial Databases (SSD'01)","author":"Zheng B.","year":"2001","unstructured":"B. Zheng and D. Lee . \" Dependent Query Processing \". In Proc. Int. Symp. Large Spatial Databases (SSD'01) , 2001 . B. Zheng and D. Lee. \"Dependent Query Processing\". In Proc. Int. Symp. Large Spatial Databases (SSD'01), 2001."}],"event":{"name":"GIS07: 15th International Symposium on Advances in Geographic Information Systems","location":"Seattle Washington","acronym":"GIS07","sponsor":["ESRI","Google Inc.","Oak Ridge National Laboratory","Microsoft Microsoft","SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1341012.1341040","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1341012.1341040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:14Z","timestamp":1750253954000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1341012.1341040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,7]]},"references-count":26,"alternative-id":["10.1145\/1341012.1341040","10.1145\/1341012"],"URL":"https:\/\/doi.org\/10.1145\/1341012.1341040","relation":{},"subject":[],"published":{"date-parts":[[2007,11,7]]},"assertion":[{"value":"2007-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}