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.0003618341 |
| 625 | Hexastore: Sextuple Indexing for Semantic Web Data Management | 2008 | VLDB | 0.00018963452 |
| 3,375 | OLAP over Imprecise Data with Domain Constraints | 2007 | VLDB | 7.1627514e-05 |
| 5,685 | Efficient Allocation Algorithms for OLAP over Imprecise Data | 2006 | VLDB | 5.37204e-05 |
| 8,465 | Inferray: fast in-memory RDF inference | 2016 | VLDB | 4.4999659e-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 |
|---|---|---|---|---|
| 359 | On the Power of Magic | 1987 | PODS | 0.00025830228 |
| 815 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.0001629507 |
| 885 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00015565543 |
| 1,389 | The Input/Output Complexity Of Transitive Closure | 1990 | SIGMOD | 0.00012247602 |
| 2,048 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.689916e-05 |
| 2,473 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 8.7048914e-05 |
| 3,417 | Overbound and Right-Linear Queries | 1991 | PODS | 7.116211e-05 |
| 5,504 | Mixed-Approach Algorithms for Transitive Closure | 1991 | PODS | 5.4716648e-05 |
| 6,499 | Hybrid Transitive Closure Algorithms | 1990 | VLDB | 5.0307246e-05 |
| 7,289 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS | 4.7692311e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,078 | On The Computation Of The Transitive Closure Of Relational Operators | 1986 | VLDB | 0.00014223265 |
| 897 | Estimating the Size of Generalized Transitive Closures | 1989 | VLDB | 0.00015484372 |
| 7,182 | A Generalized Transitive Closure for Relational Queries | 1988 | PODS | 4.802834e-05 |
| 12,881 | Implementation and performance evaluation of a parallel transitive closure algorithm on PRISMA/DB | 1993 | VLDB | 4.1905499e-05 |
| 7,289 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS | 4.7692311e-05 |
| 2,473 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 8.7048914e-05 |
| 8,569 | A Parallel Strategy for Transitive Closure using Double Hash-Based Clustering | 1990 | VLDB | 4.4893996e-05 |
| 792 | New Strategies for Computing the Transitive Closure of a Database Relation | 1987 | VLDB | 0.00016580866 |
| 815 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.0001629507 |
| 885 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00015565543 |