DBScholar

Back to papers

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)

Paper ID
h669efed0970ea09f
Venue
SIGMOD
Year
2013
Pagerank
0.00010224369
Overall Rank
1,563 | 89.50%
DOI
10.1145/2463676.2465286

Incoming Non-self Citations Over Time

Authors

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.

Rank Citing Paper Year Venue Pagerank
937 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00012977594
1,105 Path Problems in Temporal Graphs 2014 VLDB 0.00011996469
1,849 Reachability Queries on Large Dynamic Graphs: A Total Order Approach 2014 SIGMOD 9.5068688e-05
2,734 Landmark Indexing for Evaluation of Label-Constrained Reachability Queries 2017 SIGMOD 8.0789676e-05
3,107 Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees 2014 VLDB 7.6420848e-05
3,217 Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs 2022 VLDB 7.5233036e-05
3,348 Simple, Fast, and Scalable Reachability Oracle 2013 VLDB 7.3926236e-05
4,049 Reachability Querying: An Independent Permutation Labeling Approach 2014 VLDB 6.8302372e-05
5,554 Making Graphs Compact by Lossless Contraction 2021 SIGMOD 6.0858703e-05
5,717 Microblog Entity Linking with Social Temporal Context 2015 SIGMOD 6.0191048e-05
6,177 Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond 2020 VLDB 5.8598586e-05
6,200 On Querying Historical Connectivity in Temporal Graphs 2024 SIGMOD 5.8510904e-05
7,724 Minimum Strongly Connected Subgraph Collection in Dynamic Graphs 2024 VLDB 5.4672516e-05
7,840 DAG Reduction: Fast Answering Reachability Queries 2017 SIGMOD 5.442834e-05
8,788 Towards Generating Hop-constrained s-t Simple Path Graphs 2023 SIGMOD 5.2767294e-05
9,303 HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs 2023 SIGMOD 5.1978865e-05
9,805 I/O Efficient Label-Constrained Reachability Queries in Large Graphs 2024 VLDB 5.1257999e-05
10,247 Top-k Relevant Semantic Place Retrieval on Spatial RDF Data 2016 SIGMOD 5.0525742e-05
11,540 Constant-time Connectivity Querying in Dynamic Graphs 2024 SIGMOD 4.9793485e-05
11,709 Parallel Strong Connectivity Based on Faster Reachability 2023 SIGMOD 4.9793485e-05
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