Hybrid Transitive Closure Algorithms
Summary: Hybrid transitive closure algorithms — a new family outperforming matrix-based stripe/block and graph-based Tc methods. Generalizes to path problems and to source/destination selection criteria, enabling flexible endpoint constraints with strong experimental gains. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Rakesh Agrawal
- 2. H. V. Jagadish
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,679 | A Performance Study Of Transitive Closure Algorithms | 1994 | SIGMOD | 8.3223476e-05 |
| 11,193 | Parallel Strong Connectivity Based on Faster Reachability | 2023 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 157 | Traversal Recursion: A Practical Approach to Supporting Recursive Applications | 1986 | SIGMOD | 0.0004048407 |
| 792 | New Strategies for Computing the Transitive Closure of a Database Relation | 1987 | VLDB | 0.00016580866 |
| 885 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00015565543 |
| 1,078 | On The Computation Of The Transitive Closure Of Relational Operators | 1986 | VLDB | 0.00014223265 |
| 1,389 | The Input/Output Complexity Of Transitive Closure | 1990 | SIGMOD | 0.00012247602 |
| 1,905 | A Study of Transitive Closure As a Recursion Mechanism | 1987 | SIGMOD | 0.00010142772 |
| 7,182 | A Generalized Transitive Closure for Relational Queries | 1988 | PODS | 4.802834e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,855 | Distributed Transitive Closure Computations: The Disconnection Set Approach | 1990 | VLDB | 5.8698466e-05 |
| 8,569 | A Parallel Strategy for Transitive Closure using Double Hash-Based Clustering | 1990 | VLDB | 4.4893996e-05 |
| 255 | Efficient Management of Transitive Relationships in Large Data and Knowledge Bases | 1989 | SIGMOD | 0.00030342925 |
| 1,078 | On The Computation Of The Transitive Closure Of Relational Operators | 1986 | VLDB | 0.00014223265 |
| 7,289 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS | 4.7692311e-05 |
| 1,389 | The Input/Output Complexity Of Transitive Closure | 1990 | SIGMOD | 0.00012247602 |
| 815 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.0001629507 |
| 792 | New Strategies for Computing the Transitive Closure of a Database Relation | 1987 | VLDB | 0.00016580866 |
| 885 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00015565543 |
| 5,504 | Mixed-Approach Algorithms for Transitive Closure | 1991 | PODS | 5.4716648e-05 |