Raghu Ramakrishnan Shaul Dar ACM SIGMOD Conference 1994 23 2 454 465 1278 KB We present a comprehensive performance evaluation of transitive closure (reachability) algorithms for databases. The study is based upon careful implementations of the algorithms, measures page I/O, and covers algorithms for full transitive closure as we Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. Information Systems, DATABASE MANAGEMENT, Systems, Query processing. Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees. H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Query processing. F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.