Back to papers
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)
- Paper ID
- 13526
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 4.3006524e-05
- Overall Rank
- 9,680 | 32.73%
- DOI
-
10.14778/3681954.3681985
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
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.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 1,235 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.0001311113 |
| 1,445 |
Finding Regular Simple Paths in Graph Databases |
1989 |
VLDB |
0.00011937596 |
| 1,653 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.0001098717 |
| 2,206 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.2958349e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5600506e-05 |
| 2,643 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3894193e-05 |
| 3,346 |
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators |
2021 |
SIGMOD |
7.1903469e-05 |
| 4,194 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
6.3640644e-05 |
| 4,739 |
Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs |
2016 |
SIGMOD |
5.9515822e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7414979e-05 |
| 5,255 |
Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks |
2020 |
SIGMOD |
5.5991117e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7236107e-05 |
| 9,207 |
FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints |
2022 |
VLDB |
4.3694476e-05 |
| 11,201 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1905499e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 1,173 |
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation |
2012 |
VLDB |
0.00013501079 |
| 3,346 |
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators |
2021 |
SIGMOD |
7.1903469e-05 |
| 4,976 |
Constrained Shortest Path Query in a Large Time-Dependent Graph |
2019 |
VLDB |
5.7854051e-05 |
| 1,385 |
A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs |
2012 |
SIGMOD |
0.00012259478 |
| 2,192 |
Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks |
2017 |
VLDB |
9.3282272e-05 |
| 5,606 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4126223e-05 |
| 11,201 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1905499e-05 |
| 1,235 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.0001311113 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7236107e-05 |
| 10,525 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1905499e-05 |