{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T12:17:53Z","timestamp":1790943473691,"version":"4.1.0"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/icde.2011.5767844","type":"proceedings-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T16:45:21Z","timestamp":1305650721000},"page":"792-803","source":"Crossref","is-referenced-by-count":40,"title":["A continuous query system for dynamic route planning"],"prefix":"10.1109","author":[{"given":"Nirmesh","family":"Malviya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel","family":"Madden","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnab","family":"Bhattacharya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref38","year":"0"},{"key":"ref33","first-page":"121","article-title":"A new implementation of Yen's ranking loopless paths algorithm","volume":"1","author":"martins","year":"2003","journal-title":"A Quarterly Journal of Operations Research"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290682"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-007-9295-9"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1080\/13658810601079759"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00214-3"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1111\/j.1538-4632.1997.tb00966.x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814580"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039492"},{"key":"ref12","first-page":"794","article-title":"Adaptive fastest path computation on a road network: a traffic mining approach","author":"gonzalez","year":"2007","journal-title":"Proceedings of the 33rd International Conference on Very Large Data Bases Ser VLDB '07 VLDB Endowment"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.71"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/238355.238550"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63238-7_26"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/69.567054"},{"key":"ref17","article-title":"Fast shortest path distance estimation in large networks","author":"potamias","year":"2008"},{"key":"ref18","article-title":"Reach for a: Efficient point-to-point shortest path algorithms","author":"goldberg","year":"2005","journal-title":"Tech Rep"},{"key":"ref19","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","volume":"5","author":"goldberg","year":"2005","journal-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"ref28","article-title":"On trip planning queries in spatial databases","author":"li","year":"2005","journal-title":"SSTD"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59179-2_15"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687763"},{"key":"ref3","first-page":"33","article-title":"Exact and approximate distances in graphs - a survey","author":"zwick","year":"0","journal-title":"9th Annual European Symposium on Algorithms"},{"key":"ref6","article-title":"Anytime dynamic A*: An anytime, replanning algorithm","author":"likhachev","year":"2005","journal-title":"International Conference on Automated Planning and Scheduling"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1182807.1182821"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0028290","author":"ramalingam","year":"1996","journal-title":"Bounded Incremental Computation"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref2","first-page":"369","article-title":"Experimental analysis of dynamic all pairs shortest path algorithms","author":"demetrescu","year":"2004","journal-title":"SODA"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1048"},{"key":"ref1","article-title":"NAVTEQ map data","year":"0"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.5"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739084"},{"key":"ref23","first-page":"812","article-title":"Bidirectional core-based routing in dynamic time-dependent road networks","volume":"8","author":"delling","year":"0","journal-title":"ISAAC ‘"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516418"},{"key":"ref25","article-title":"Continuous nearest neighbor monitoring in road networks","author":"mouratidis","year":"2006","journal-title":"VLDB"}],"event":{"name":"2011 IEEE International Conference on Data Engineering (ICDE 2011)","location":"Hannover, Germany","start":{"date-parts":[[2011,4,11]]},"end":{"date-parts":[[2011,4,16]]}},"container-title":["2011 IEEE 27th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5765035\/5767827\/05767844.pdf?arnumber=5767844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T20:17:05Z","timestamp":1497903425000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5767844\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/icde.2011.5767844","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}