CANDS: Continuous Optimal Navigation via Distributed Stream Processing
Summary: CANDS uses distributed stream processing for continuous optimal shortest-path queries on dynamic road networks. Asynchronous, it detects affected routes after updates and quickly revises paths to preserve optimality, outperforming GPS and Pregel-like systems by orders of magnitude. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Dingyu Yang
- 2. Dongxiang Zhang
- 3. Kian-Lee Tan
- 4. Jian Cao
- 5. Frédéric Le Mouël
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,542 | Distributed Processing of k Shortest Path Queries over Dynamic Road Networks | 2020 | SIGMOD | 6.1019408e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0019005923 |
| 260 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00030040036 |
| 288 | Storm @Twitter | 2014 | SIGMOD | 0.00028939871 |
| 1,230 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB | 0.00013150837 |
| 1,690 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD | 0.00010904736 |
| 3,699 | Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach | 2007 | VLDB | 6.8337468e-05 |
| 6,071 | IBM InfoSphere Streams for Scalable, Real-Time, Intelligent Transportation Services | 2010 | SIGMOD | 5.2261393e-05 |
Previous
Page 1 / 1
Next