Efficient Shortest Path Counting on Large Road Networks
Summary: Tree-structured index for counting shortest paths between two vertices in large road networks. Optimizations speed up index construction; experiments on 14 real networks show superior query throughput and a compact index vs state-of-the-art. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yu-Xuan Qiu (University of Technology Sydney)
- 2. Dong Wen (University of New South Wales)
- 3. Lu Qin (University of Technology Sydney)
- 4. Wentao Li (University of Technology Sydney)
- 5. Rong-Hua Li (Beijing Institute of Technology)
- 6. Ying Zhang (University of Technology Sydney)
BibTeX Citation
@article{qiu_vldb22,
title = {{Efficient Shortest Path Counting on Large Road Networks}},
author = {Qiu, Yu-Xuan and Wen, Dong and Qin, Lu and Li, Wentao and Li, Rong-Hua and Zhang, Ying},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {10},
pages = {2098--2110},
doi = {10.14778/3547305.3547315},
url = {https://doi.org/10.14778/3547305.3547315},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,788 | Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks | 2025 | SIGMOD | 5.093636e-05 |
| 10,845 | Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs | 2025 | VLDB | 5.093636e-05 |
| 10,918 | Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks | 2025 | VLDB | 5.093636e-05 |
| 11,248 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB | 5.093636e-05 |
| 11,271 | Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks | 2024 | VLDB | 5.093636e-05 |
| 11,347 | Expanding Reverse Nearest Neighbors | 2024 | VLDB | 5.093636e-05 |
| 11,401 | QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks | 2023 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 195 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025813775 |
| 949 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB | 0.00013028107 |
| 1,205 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD | 0.00011664469 |
| 1,613 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD | 0.00010216983 |
| 2,871 | P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators | 2021 | SIGMOD | 8.0110616e-05 |
| 3,028 | Motivo: fast motif counting via succinct color coding and adaptive sampling | 2019 | VLDB | 7.8349117e-05 |
| 5,571 | Hub Labeling for Shortest Path Counting | 2020 | SIGMOD | 6.1686653e-05 |
| 5,987 | Progressive Top-K Nearest Neighbors Search in Large Road Networks | 2020 | SIGMOD | 6.0183678e-05 |
Previous
Page 1 / 1
Next