Mixed-Approach Algorithms for Transitive Closure
Summary: Analyzes two dual approaches for directed transitive closure that can differ asymptotically and combines them into a mixed reachability-tree algorithm. Proves a connectivity-based bound O(Σ_{(x,y)} CONN(x,y)) that better captures structural ease and outperforms many single-approach algorithms. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,675 | A Performance Study Of Transitive Closure Algorithms | 1994 | SIGMOD | 8.3315228e-05 |
| 3,414 | Overbound and Right-Linear Queries | 1991 | PODS | 7.1232056e-05 |
| 7,293 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS | 4.7740089e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 880 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00015667998 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 815 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.00016369666 |
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 2,675 | A Performance Study Of Transitive Closure Algorithms | 1994 | SIGMOD | 8.3315228e-05 |
| 5,366 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD | 5.5460085e-05 |
| 1,055 | On The Computation Of The Transitive Closure Of Relational Operators | 1986 | VLDB | 0.00014422575 |
| 1,553 | A Memory Efficient Reachability Data Structure Through Bit Vector Compression | 2011 | SIGMOD | 0.00011402871 |
| 6,504 | Hybrid Transitive Closure Algorithms | 1990 | VLDB | 5.0357556e-05 |
| 7,293 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS | 4.7740089e-05 |
| 1,389 | The Input/Output Complexity Of Transitive Closure | 1990 | SIGMOD | 0.00012260807 |
| 880 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00015667998 |