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)

Paper ID: h6a7db951d0a3cb40
Venue: VLDB
Year: 1990
Pagerank: 5.6261341e-05
Overall Rank: 6,985 | 53.06%
DOI: -

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,557	A Performance Study Of Transitive Closure Algorithms	1994	SIGMOD	7.2052788e-05
11,715	Parallel Strong Connectivity Based on Faster Reachability	2023	SIGMOD	4.9769913e-05

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
225	Traversal Recursion: A Practical Approach to Supporting Recursive Applications	1986	SIGMOD	0.00023984019
1,110	New Strategies for Computing the Transitive Closure of a Database Relation	1987	VLDB	0.00011979358
1,287	On the Computation of the Transitive Closure of Relational Operators	1986	VLDB	0.00011179513
1,364	Efficient Transitive Closure Algorithms	1988	VLDB	0.00010909199
1,905	The Input/Output Complexity Of Transitive Closure	1990	SIGMOD	9.3947277e-05
2,110	A Study of Transitive Closure As a Recursion Mechanism	1987	SIGMOD	9.0195865e-05
7,583	A Generalized Transitive Closure for Relational Queries	1988	PODS	5.4898987e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	5,456	Distributed Transitive Closure Computations: The Disconnection Set Approach	1990	VLDB
2	8,945	A Parallel Strategy for Transitive Closure using Double Hash-Based Clustering	1990	VLDB
3	1,287	On the Computation of the Transitive Closure of Relational Operators	1986	VLDB
4	294	Efficient Management of Transitive Relationships in Large Data and Knowledge Bases	1989	SIGMOD
5	8,203	On Tree-Based Techniques for Query Evaluation	1992	PODS
6	1,905	The Input/Output Complexity Of Transitive Closure	1990	SIGMOD
7	1,140	Direct Algorithms for Computing the Transitive Closure of Database Relations	1987	VLDB
8	1,110	New Strategies for Computing the Transitive Closure of a Database Relation	1987	VLDB
9	1,364	Efficient Transitive Closure Algorithms	1988	VLDB
10	6,100	Mixed-Approach Algorithms for Transitive Closure	1991	PODS