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 (Shanghai Jiao Tong University)
- 2. Dongxiang Zhang (National University of Singapore)
- 3. Kian-Lee Tan (National University of Singapore)
- 4. Jian Cao (Shanghai Jiao Tong University)
- 5. Frédéric Le Mouël (National Institute for Research in Digital Science and Technology CITI Laboratory; National Institute of Applied Sciences of Lyon; University of Lyon)
BibTeX Citation
@article{yang_vldb15,
title = {{CANDS: Continuous Optimal Navigation via Distributed Stream Processing}},
author = {Yang, Dingyu and Zhang, Dongxiang and Tan, Kian-Lee and Cao, Jian and Le Mouël, Frédéric},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {8},
number = {2},
pages = {137--148},
doi = {10.14778/2735471.2735475},
url = {https://doi.org/10.14778/2735471.2735475},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,685 | Distributed Processing of k Shortest Path Queries over Dynamic Road Networks | 2020 | SIGMOD | 6.5628805e-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 |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012250108 |
| 195 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025813775 |
| 220 | Storm @Twitter | 2014 | SIGMOD | 0.00024244587 |
| 1,205 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD | 0.00011664469 |
| 1,251 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB | 0.00011484136 |
| 3,817 | Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach | 2007 | VLDB | 7.0999891e-05 |
| 5,647 | IBM InfoSphere Streams for Scalable, Real-Time, Intelligent Transportation Services | 2010 | SIGMOD | 6.1354257e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 949 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB |
| 2 | 7,226 | Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach | 2022 | VLDB |
| 3 | 5,208 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB |
| 4 | 5,987 | Progressive Top-K Nearest Neighbors Search in Large Road Networks | 2020 | SIGMOD |
| 5 | 9,143 | Processing Proximity Relations in Road Networks | 2010 | SIGMOD |
| 6 | 1,251 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB |
| 7 | 10,379 | Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks | 2026 | SIGMOD |
| 8 | 2,097 | Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees | 2020 | VLDB |
| 9 | 9,229 | Continuously Monitoring Alternative Shortest Paths on Road Networks | 2020 | VLDB |
| 10 | 4,685 | Distributed Processing of k Shortest Path Queries over Dynamic Road Networks | 2020 | SIGMOD |