A Continuous Query System for Dynamic Route Planning
In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A simple approach to this problem would be to recompute the best path for all queries on arrival of every delay update. How...
Main Authors: | Malviya, Nirmesh, Madden, Samuel R., Bhattacharyya, Arnab |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
International Conference on Data Engineering
2011
|
Online Access: | http://hdl.handle.net/1721.1/62815 https://orcid.org/0000-0002-7470-3265 |
Similar Items
-
Recovery algorithms for in-memory OLTP databases
by: Malviya, Nirmesh
Published: (2012) -
Query Optimization for Dynamic Imputation
by: Cambronero, José, et al.
Published: (2021) -
Diversified Routing Queries in Dynamic Road Networks
by: Jianmin Li, et al.
Published: (2019-01-01) -
Scorpion: Explaining Away Outliers in Aggregate Queries
by: Wu, Eugene, et al.
Published: (2014) -
A demonstration of DBWipes: Clean as you query
by: Wu, Eugene, et al.
Published: (2014)