A Performance Study Of Transitive Closure Algorithms
Summary: Comprehensive evaluation of transitive-closure algorithms in a uniform framework, focusing on page I/O, buffering, and full/partial reachability across DAGs. Finds standard metrics do not predict I/O cost and proposes a DAG-height/width workload model from a single traversal. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shaul Dar
- 2. Raghu Ramakrishnan
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 186 | Proximity Search in Databases | 1998 | VLDB | 0.00036215179 |
| 624 | Hexastore: Sextuple Indexing for Semantic Web Data Management | 2008 | VLDB | 0.00018988711 |
| 3,372 | OLAP over Imprecise Data with Domain Constraints | 2007 | VLDB | 7.1683982e-05 |
| 5,674 | Efficient Allocation Algorithms for OLAP over Imprecise Data | 2006 | VLDB | 5.377195e-05 |
| 8,468 | Inferray: fast in-memory RDF inference | 2016 | VLDB | 4.504284e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 365 | On the Power of Magic | 1987 | PODS | 0.00025585898 |
| 815 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.00016369666 |
| 880 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00015667998 |
| 1,389 | The Input/Output Complexity Of Transitive Closure | 1990 | SIGMOD | 0.00012260807 |
| 2,042 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.699257e-05 |
| 2,474 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 8.7135761e-05 |
| 3,414 | Overbound and Right-Linear Queries | 1991 | PODS | 7.1232056e-05 |
| 5,492 | Mixed-Approach Algorithms for Transitive Closure | 1991 | PODS | 5.4771871e-05 |
| 6,504 | Hybrid Transitive Closure Algorithms | 1990 | VLDB | 5.0357556e-05 |
| 7,293 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS | 4.7740089e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,055 | On The Computation Of The Transitive Closure Of Relational Operators | 1986 | VLDB | 0.00014422575 |
| 688 | Estimating the Size of Generalized Transitive Closures | 1989 | VLDB | 0.00018134733 |
| 7,181 | A Generalized Transitive Closure for Relational Queries | 1988 | PODS | 4.8074621e-05 |
| 12,871 | Implementation and performance evaluation of a parallel transitive closure algorithm on PRISMA/DB | 1993 | VLDB | 4.1945683e-05 |
| 7,293 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS | 4.7740089e-05 |
| 2,474 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 8.7135761e-05 |
| 8,572 | A Parallel Strategy for Transitive Closure using Double Hash-Based Clustering | 1990 | VLDB | 4.4937074e-05 |
| 786 | New Strategies for Computing the Transitive Closure of a Database Relation | 1987 | VLDB | 0.00016660109 |
| 815 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.00016369666 |
| 880 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00015667998 |