DBScholar

Back to papers

FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints

Summary: FHL-Cube augments Forest Hop Labeling with a hierarchical skyline cube, deriving high-dimensional paths from lower-dimensional skylines to support arbitrary constraint combinations. Efficient cube concatenation, pruning, and reduced-height labels accelerate both construction and MCSP queries. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
12980
Venue
VLDB
Year
2022
Pagerank
5.2798829e-05
Overall Rank
9,364 | 35.76%
DOI
10.14778/3551793.3551856

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{liu_vldb22,
        title = {{FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints}},
        author = {Liu, Ziyi and Li, Lei and Zhang, Mengxuan and Hua, Wen and Zhou, Xiaofang},
        journal = {PVLDB},
        series = {{VLDB} '22},
        volume = {15},
        number = {11},
        pages = {3112--3125},
        doi = {10.14778/3551793.3551856},
        url = {https://doi.org/10.14778/3551793.3551856},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

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

Semantically Similar Papers