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 (IBM)
- 2. H. V. Jagadish (AT&T)
BibTeX Citation
@article{agrawal_vldb90,
title = {{Hybrid Transitive Closure Algorithms}},
author = {Agrawal, Rakesh and Jagadish, H. V.},
journal = {PVLDB},
series = {{VLDB} '90},
pages = {326--334},
year = {1990}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,491 | A Performance Study Of Transitive Closure Algorithms | 1994 | SIGMOD | 7.3658999e-05 |
| 11,394 | Parallel Strong Connectivity Based on Faster Reachability | 2023 | SIGMOD | 5.093636e-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 |
|---|---|---|---|---|
| 217 | Traversal Recursion: A Practical Approach to Supporting Recursive Applications | 1986 | SIGMOD | 0.00024458594 |
| 1,086 | New Strategies for Computing the Transitive Closure of a Database Relation | 1987 | VLDB | 0.00012252192 |
| 1,259 | On the Computation of the Transitive Closure of Relational Operators | 1986 | VLDB | 0.00011437537 |
| 1,330 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00011140171 |
| 1,855 | The Input/Output Complexity Of Transitive Closure | 1990 | SIGMOD | 9.606146e-05 |
| 2,076 | A Study of Transitive Closure As a Recursion Mechanism | 1987 | SIGMOD | 9.212586e-05 |
| 7,438 | A Generalized Transitive Closure for Relational Queries | 1988 | PODS | 5.6184826e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,341 | Distributed Transitive Closure Computations: The Disconnection Set Approach | 1990 | VLDB |
| 2 | 8,775 | A Parallel Strategy for Transitive Closure using Double Hash-Based Clustering | 1990 | VLDB |
| 3 | 282 | Efficient Management of Transitive Relationships in Large Data and Knowledge Bases | 1989 | SIGMOD |
| 4 | 1,259 | On the Computation of the Transitive Closure of Relational Operators | 1986 | VLDB |
| 5 | 8,035 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS |
| 6 | 1,855 | The Input/Output Complexity Of Transitive Closure | 1990 | SIGMOD |
| 7 | 1,114 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB |
| 8 | 1,086 | New Strategies for Computing the Transitive Closure of a Database Relation | 1987 | VLDB |
| 9 | 1,330 | Efficient Transitive Closure Algorithms | 1988 | VLDB |
| 10 | 5,975 | Mixed-Approach Algorithms for Transitive Closure | 1991 | PODS |