Back to papers
FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints
Summary: Skyline-cube-based extension of the Forest Hop Labeling (FHL) index for flexible MCSP queries. Hierarchical skyline cube derives high-dim routes from lower ones, enables fast single- and multi-hop concatenation with pruning, and lowers index height for faster MCSP on real road networks.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12793
- Venue
- VLDB
- Year
- 2022
- Pagerank
- 4.3694476e-05
- Overall Rank
- 9,207 | 36.02%
- DOI
-
10.14778/3551793.3551856
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 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 |
| 260 |
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling |
2013 |
SIGMOD |
0.00030020929 |
| 746 |
An Optimal and Progressive Algorithm for Skyline Queries |
2003 |
SIGMOD |
0.00017212135 |
| 1,021 |
Path Problems in Temporal Graphs |
2014 |
VLDB |
0.00014608331 |
| 1,471 |
Maximal Vector Computation in Large Data Sets |
2005 |
VLDB |
0.0001181903 |
| 1,554 |
Efficient Route Planning on Public Transportation Networks: A Labelling Approach |
2015 |
SIGMOD |
0.00011384233 |
| 2,192 |
Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks |
2017 |
VLDB |
9.3282272e-05 |
| 2,206 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.2958349e-05 |
| 2,643 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3894193e-05 |
| 2,699 |
Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces |
2005 |
VLDB |
8.2758509e-05 |
| 3,171 |
Minimal On-Road Time Route Scheduling on Time-Dependent Graphs |
2017 |
VLDB |
7.4471807e-05 |
| 6,491 |
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network |
2021 |
VLDB |
5.0368875e-05 |
| 7,078 |
Computing Closed Skycubes |
2010 |
VLDB |
4.835809e-05 |
| 7,711 |
Accelerating Exact Constrained Shortest Paths on GPUs |
2021 |
VLDB |
4.6670758e-05 |
| 9,197 |
SkyGraph: Retrieving Regions of Interest using Skyline Subgraph Queries |
2017 |
VLDB |
4.3723013e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 1,893 |
Querying Shortest Paths on Time Dependent Road Networks |
2019 |
VLDB |
0.00010175836 |
| 10,477 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
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 |
| 9,472 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
4.3300131e-05 |
| 10,525 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1905499e-05 |
| 6,595 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
4.9949537e-05 |
| 2,206 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.2958349e-05 |
| 9,680 |
PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks |
2024 |
VLDB |
4.3006524e-05 |
| 11,201 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1905499e-05 |