QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks
Summary: QHL: an exact CSP algorithm for road networks that uses CSP-informed pruning and a preprocessed index of pruning conditions to speed up queries. Real-world experiments show CSP queries around 50 µs and order-of-magnitude improvements over prior work. (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. Libin Wang (Hong Kong University of Science and Technology)
- 2. Raymond Chi-Wing Wong (Hong Kong University of Science and Technology)
BibTeX Citation
@inproceedings{wang_sigmod23,
title = {{QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks}},
author = {Wang, Libin and Wong, Raymond Chi-Wing},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3589300},
url = {https://dl.acm.org/doi/10.1145/3589300},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,815 | PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks | 2024 | VLDB | 5.214913e-05 |
| 10,789 | Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks | 2025 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next