A comparison of transitive closure algorithms for use in intelligent database systems
K. Grant, Mahdi Abdelguerfi, M. Dennis, B. Thomas, Wayne Patterson · 2002
In this paper we discuss several transitive closure algorithms used to compute the answers to recursive database queries. We also compare the run-time performance of two of these algorithms under various conditions. Particular attention is paid to the problem of the "I/O bottleneck", which is the chief factor in determining the performance of transitive closure algorithms in real-life settings.