Database Paper Browser

Back to papers

New Strategies for Computing the Transitive Closure of a Database Relation

Summary: Two dynamic data-size reduction strategies introduced for computing the transitive closure, integrated into a hash-based algorithm. Empirical results show faster convergence to the least fixed point and outperformance of other approaches in most cases. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7809
Venue
VLDB
Year
1987
Pagerank
0.00016660109
Overall Rank
786 | 94.54%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 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