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
- 12792
- Venue
- VLDB
- Year
- 2022
- Pagerank
- 4.3736393e-05
- Overall Rank
- 9,205 | 35.97%
- 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.00030040036 |
| 749 |
An Optimal and Progressive Algorithm for Skyline Queries |
2003 |
SIGMOD |
0.00017228334 |
| 1,024 |
Path Problems in Temporal Graphs |
2014 |
VLDB |
0.00014609643 |
| 1,473 |
Maximal Vector Computation in Large Data Sets |
2005 |
VLDB |
0.00011828508 |
| 1,555 |
Efficient Route Planning on Public Transportation Networks: A Labelling Approach |
2015 |
SIGMOD |
0.00011395261 |
| 2,188 |
Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks |
2017 |
VLDB |
9.3372315e-05 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 2,639 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3975113e-05 |
| 2,696 |
Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces |
2005 |
VLDB |
8.2814799e-05 |
| 3,164 |
Minimal On-Road Time Route Scheduling on Time-Dependent Graphs |
2017 |
VLDB |
7.4543722e-05 |
| 6,494 |
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network |
2021 |
VLDB |
5.0417258e-05 |
| 7,082 |
Computing Closed Skycubes |
2010 |
VLDB |
4.8404527e-05 |
| 7,712 |
Accelerating Exact Constrained Shortest Paths on GPUs |
2021 |
VLDB |
4.6715558e-05 |
| 9,193 |
SkyGraph: Retrieving Regions of Interest using Skyline Subgraph Queries |
2017 |
VLDB |
4.3764958e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,874 |
A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks |
2025 |
VLDB |
4.1945683e-05 |
| 10,467 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 1,230 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.00013150837 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 9,470 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
4.3341665e-05 |
| 10,516 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 6,594 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
4.999751e-05 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 9,680 |
PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks |
2024 |
VLDB |
4.3047774e-05 |
| 11,199 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1945683e-05 |