{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:29:49Z","timestamp":1725467389480},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1109\/icde.2008.4497586","type":"proceedings-article","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T15:04:39Z","timestamp":1209481479000},"page":"1451-1453","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Query Processing in Large Traffic Networks"],"prefix":"10.1109","author":[{"given":"Hans-Peter","family":"Kriegel","sequence":"first","affiliation":[]},{"given":"Peer","family":"Kroger","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Kunath","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","article-title":"heuristic search in data base systems","author":"kung","year":"1986","journal-title":"Expert Database Systems"},{"journal-title":"Introduction to Algorithms","year":"1990","author":"corman","key":"2"},{"key":"10","article-title":"distance indexing on road networks","author":"hu","year":"2006","journal-title":"Proc Int Conf on Very Large Databases (VLDB'06)"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"6","doi-asserted-by":"crossref","DOI":"10.1007\/11427186_13","article-title":"acceleration of shortest path and constrained shortest path computation","author":"ko?hler","year":"2005","journal-title":"Proc Int WS Efficient and Experimental Algorithms (WEA'05)"},{"key":"5","article-title":"hiti graph model of topographical roadmaps in navigation systems","author":"jung","year":"1996","journal-title":"Proc Int Conf Data Engineering (ICDE)"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/88636.88888"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365733"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025153016110"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-73540-3_5","article-title":"generalizing the optimality of multi-step k-nearest neighbor query processing","author":"kriegel","year":"2007","journal-title":"Proc 10th Int Symp on Spatial and Temporal Databases (SSTD'07)"}],"event":{"name":"2008 IEEE 24th International Conference on Data Engineering (ICDE 2008)","start":{"date-parts":[[2008,4,7]]},"location":"Cancun, Mexico","end":{"date-parts":[[2008,4,12]]}},"container-title":["2008 IEEE 24th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4492792\/4497384\/04497586.pdf?arnumber=4497586","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T03:36:04Z","timestamp":1497756964000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4497586\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/icde.2008.4497586","relation":{},"subject":[],"published":{"date-parts":[[2008,4]]}}}