Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks
Summary: COLA: approximate CSP for large road networks using partitioning and boundary-vertex landmarks. Alpha-Dijk inside partitions prunes via landmarks; delivers sub-second CSP queries on continental graphs with large speedups, even without an index. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sibo Wang (Nanyang Technological University)
- 2. Xiaokui Xiao (Nanyang Technological University)
- 3. Yin Yang (Hamad Bin Khalifa University)
- 4. Wenqing Lin (Qatar Computing Research Institute)
BibTeX Citation
@article{wang_vldb17,
title = {{Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks}},
author = {Wang, Sibo and Xiao, Xiaokui and Yang, Yin and Lin, Wenqing},
journal = {PVLDB},
series = {{VLDB} '17},
volume = {10},
number = {2},
pages = {61},
doi = {10.14778/3015274.3015277},
url = {https://doi.org/10.14778/3015274.3015277},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
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 |
|---|---|---|---|---|
| 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,598 | Efficient Route Planning on Public Transportation Networks: A Labelling Approach | 2015 | SIGMOD | 0.00010242826 |
| 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD | 9.7380494e-05 |
| 3,415 | On k-Path Covers and their Applications | 2014 | VLDB | 7.4313072e-05 |
Previous
Page 1 / 1
Next