dc.contributor.author | Malviya, Nirmesh | |
dc.contributor.author | Madden, Samuel R. | |
dc.contributor.author | Bhattacharyya, Arnab | |
dc.date.accessioned | 2011-05-11T18:00:10Z | |
dc.date.available | 2011-05-11T18:00:10Z | |
dc.date.issued | 2011-04 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/62815 | |
dc.description.abstract | 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. However, such
a naive approach scales poorly when there are many users who
have requested routes in the system.
Instead, we propose two new classes of approximate techniques
– K-paths and proximity measures to substantially speed up
processing of the set of designated routes specified by continuous
route planning queries in the face of incoming traffic delay
updates. Our techniques work through a combination of precomputation
of likely good paths and by avoiding complete
recalculations on every delay update, instead only sending the
user new routes when delays change significantly. Based on an
experimental evaluation with 7,000 drives from real taxi cabs,
we found that the routes delivered by our techniques are within
5% of the best shortest path and have run times an order of
magnitude or less compared to a naive approach. | en_US |
dc.language.iso | en_US | |
dc.publisher | International Conference on Data Engineering | en_US |
dc.relation.isversionof | http://www.icde2011.org/node/94 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | A Continuous Query System for Dynamic Route Planning | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Malviya, Nirmesh, Samuel Madden, and Arnab Bhattacharya. "A Continuous Query System for Dynamic Route Planning" in Proceedings of the International Conference on Data Engineering, ICDE 2011, April 11-16, Hannover, Germany. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.approver | Madden, Samuel R. | |
dc.contributor.mitauthor | Malviya, Nirmesh | |
dc.contributor.mitauthor | Madden, Samuel R. | |
dc.relation.journal | International Conference on Data Engineering (ICDE 2011) | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
dspace.orderedauthors | Malviya, Nirmesh; Madden, Samuel; Bhattacharya, Arnab | |
dc.identifier.orcid | https://orcid.org/0000-0002-7470-3265 | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |