Database Paper Browser

Back to papers

A Generalized Transitive Closure for Relational Queries

Summary: Introduce a generalized transitive-closure operator for relational algebra based on a maximally general associative composition definable using only relational operators. Enables use of standard transitive-closure algorithms and supports selection without full materialization. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
843
Venue
PODS
Year
1988
Pagerank
4.8074621e-05
Overall Rank
7,181 | 50.05%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
2,474 Graph-Theoretic Methods In Database Theory 1990 PODS 8.7135761e-05
6,504 Hybrid Transitive Closure Algorithms 1990 VLDB 5.0357556e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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