PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks
Summary: Introduces PCSP, an index that answers Label-Constrained Shortest Path (LCSP) queries by concatenating two shortest paths that each partially satisfy a regular-language constraint, enabling support for more expressive regular languages. Adds pruning techniques and an implementation achieving ≈100 µs/query and up to 100× speedup over prior art. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
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
@article{wang_vldb24,
title = {{PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks}},
author = {Wang, Libin and Wong, Raymond Chi-Wing},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {11},
pages = {3082--3094},
doi = {10.14778/3681954.3681985},
url = {https://doi.org/10.14778/3681954.3681985},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,789 | Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks | 2025 | SIGMOD | 5.093636e-05 |
| 10,919 | X-Blossom: Massive Parallelization of Graph Maximum Matching | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next