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 (Yantai University)
- 2. Xiaohui Yu (York University)
- 3. Nick Koudas (University of Toronto)
- 4. Yang Liu (Wilfrid Laurier University)
- 5. Yifan Li (Chinese Ministry of Education; York University)
- 6. Yueting Chen (York University)
- 7. Dingyu Yang (Alibaba)
BibTeX Citation
@inproceedings{yu_sigmod20,
title = {{Distributed Processing of k Shortest Path Queries over Dynamic Road Networks}},
author = {Yu, Ziqiang and Yu, Xiaohui and Koudas, Nick and Liu, Yang and Li, Yifan and Chen, Yueting and Yang, Dingyu},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3389735},
url = {https://dl.acm.org/doi/10.1145/3318464.3389735},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,931 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB | 6.3376097e-05 |
| 7,008 | An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network | 2021 | VLDB | 5.6061911e-05 |
| 8,721 | QARTA: An ML-based System for Accurate Map Services | 2021 | VLDB | 5.2705676e-05 |
| 9,453 | Minimum Vertex Augmentation | 2021 | VLDB | 5.1608635e-05 |
| 11,823 | k-Best Egalitarian Stable Marriages for Task Assignment | 2023 | VLDB | 4.9605343e-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 |
|---|---|---|---|---|
| 165 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00027323925 |
| 192 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025740385 |
| 3,157 | Order Dispatch in Price-aware Ridesharing | 2018 | VLDB | 7.5683523e-05 |
| 5,175 | Performance Guarantees for Distributed Reachability Queries | 2012 | VLDB | 6.2289864e-05 |
| 12,468 | CANDS: Continuous Optimal Navigation via Distributed Stream Processing | 2015 | VLDB | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,125 | Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs | 2016 | SIGMOD |
| 2 | 6,836 | Efficient Algorithms for Optimal Location Queries in Road Networks | 2014 | SIGMOD |
| 3 | 1,430 | On k-skip Shortest Paths | 2011 | SIGMOD |
| 4 | 1,717 | Querying Shortest Paths on Time Dependent Road Networks | 2019 | VLDB |
| 5 | 10,719 | High-Throughput k Nearest Neighbors Search in Road Networks | 2026 | SIGMOD |
| 6 | 2,150 | Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees | 2020 | VLDB |
| 7 | 8,695 | Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks | 2025 | SIGMOD |
| 8 | 5,357 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB |
| 9 | 7,399 | Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach | 2022 | VLDB |
| 10 | 1,270 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB |