TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph
Summary: TF-label proposes a topological folding labeling scheme for reachability in large graphs; folds the graph in half to shrink labels. Efficient construction and optimization; scalable index-building yield faster reachability queries than state-of-the-art methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. James Cheng (Chinese University of Hong Kong)
- 2. Silu Huang (Chinese University of Hong Kong)
- 3. Huanhuan Wu (Chinese University of Hong Kong)
- 4. Ada Wai-Chee Fu (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{cheng_sigmod13,
title = {{TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph}},
author = {Cheng, James and Huang, Silu and Wu, Huanhuan and Fu, Ada Wai-Chee},
series = {{SIGMOD} '13},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2463676.2465286},
url = {https://dl.acm.org/doi/10.1145/2463676.2465286},
year = {2013}
}
Incoming Citations (Sorted by Pagerank)
Showing 20 of 20 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,622 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB |
| 2 | 1,553 | Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks | 2014 | VLDB |
| 3 | 6,603 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB |
| 4 | 7,322 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |
| 5 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 6 | 9,625 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |
| 7 | 3,979 | Reachability Querying: An Independent Permutation Labeling Approach | 2014 | VLDB |
| 8 | 3,278 | Simple, Fast, and Scalable Reachability Oracle | 2013 | VLDB |
| 9 | 2,490 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD |
| 10 | 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |