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.00010186448
Overall Rank
1,564 | 89.52%
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
942 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00012936571
1,104 Path Problems in Temporal Graphs 2014 VLDB 0.00011963283
1,859 Reachability Queries on Large Dynamic Graphs: A Total Order Approach 2014 SIGMOD 9.4722343e-05
2,744 Landmark Indexing for Evaluation of Label-Constrained Reachability Queries 2017 SIGMOD 8.0484475e-05
3,101 Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees 2014 VLDB 7.6310428e-05
3,229 Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs 2022 VLDB 7.4950161e-05
3,357 Simple, Fast, and Scalable Reachability Oracle 2013 VLDB 7.3652047e-05
4,076 Reachability Querying: An Independent Permutation Labeling Approach 2014 VLDB 6.8048601e-05
5,571 Making Graphs Compact by Lossless Contraction 2021 SIGMOD 6.0628752e-05
5,732 Microblog Entity Linking with Social Temporal Context 2015 SIGMOD 5.9963673e-05
6,192 Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond 2020 VLDB 5.8377174e-05
6,209 On Querying Historical Connectivity in Temporal Graphs 2024 SIGMOD 5.8323161e-05
7,743 Minimum Strongly Connected Subgraph Collection in Dynamic Graphs 2024 VLDB 5.4465939e-05
7,861 DAG Reduction: Fast Answering Reachability Queries 2017 SIGMOD 5.4225547e-05
8,815 Towards Generating Hop-constrained s-t Simple Path Graphs 2023 SIGMOD 5.2567916e-05
9,324 HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs 2023 SIGMOD 5.1815803e-05
9,846 I/O Efficient Label-Constrained Reachability Queries in Large Graphs 2024 VLDB 5.1064323e-05
10,283 Top-k Relevant Semantic Place Retrieval on Spatial RDF Data 2016 SIGMOD 5.0334833e-05
11,595 Constant-time Connectivity Querying in Dynamic Graphs 2024 SIGMOD 4.9605343e-05
11,761 Parallel Strong Connectivity Based on Faster Reachability 2023 SIGMOD 4.9605343e-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