Distributed Processing of k Shortest Path Queries over Dynamic Road Networks
Summary: Presents KSP-DG, a distributed approach for k-shortest paths in dynamic road networks via subgraph partitioning. DTLP: two-level index of traffic-insensitive virtual paths pruning subgraphs to support scalable KSP queries; tests show gains. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ziqiang Yu
- 2. Xiaohui Yu
- 3. Nick Koudas
- 4. Yang Liu
- 5. Yifan Li
- 6. Yueting Chen
- 7. Dingyu Yang
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,620 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB | 6.0368524e-05 |
| 6,491 | An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network | 2021 | VLDB | 5.0368875e-05 |
| 8,287 | QARTA: An ML-based System for Accurate Map Services | 2021 | VLDB | 4.5392079e-05 |
| 9,096 | Minimum Vertex Augmentation | 2021 | VLDB | 4.3925641e-05 |
| 11,264 | k-Best Egalitarian Stable Marriages for Task Assignment | 2023 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 182 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00036955562 |
| 260 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00030020929 |
| 2,338 | Order Dispatch in Price-aware Ridesharing | 2018 | VLDB | 9.0084742e-05 |
| 5,051 | Performance Guarantees for Distributed Reachability Queries | 2012 | VLDB | 5.7267112e-05 |
| 11,936 | CANDS: Continuous Optimal Navigation via Distributed Stream Processing | 2015 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next