On Tree-Based Techniques for Query Evaluation
Summary: Uses tree-structured intermediate results for query evaluation; gives a new algorithm for computing transitive closure from specified source nodes that outperforms prior methods and applies to many nonrecursive queries. Shows tree-based Warshall achieves an O(n·e) bound versus worse flat-representation costs. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,675 | A Performance Study Of Transitive Closure Algorithms | 1994 | SIGMOD | 8.3315228e-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 |
|---|---|---|---|---|
| 673 | One-Sided Recursions | 1987 | PODS | 0.00018348841 |
| 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 |
| 1,648 | A Study of Transitive Closure As a Recursion Mechanism | 1987 | SIGMOD | 0.00011028408 |
| 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 |
| 3,585 | Right-, left- and multi-linear rule transformations that maintain context information | 1990 | VLDB | 6.9454028e-05 |
| 5,492 | Mixed-Approach Algorithms for Transitive Closure | 1991 | PODS | 5.4771871e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,675 | A Performance Study Of Transitive Closure Algorithms | 1994 | SIGMOD | 8.3315228e-05 |
| 9,112 | Optimizing Recursive Queries in SQL | 2005 | SIGMOD | 4.3942347e-05 |
| 7,181 | A Generalized Transitive Closure for Relational Queries | 1988 | PODS | 4.8074621e-05 |
| 815 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.00016369666 |
| 3,117 | Processing Queries on Tree-Structured Data Efficiently | 2006 | PODS | 7.5407318e-05 |
| 6,949 | Tree-Width and Functional Dependencies in Databases | 2008 | PODS | 4.8898337e-05 |
| 3,999 | EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES (Extended Abstract) | 1987 | PODS | 6.5469939e-05 |
| 1,055 | On The Computation Of The Transitive Closure Of Relational Operators | 1986 | VLDB | 0.00014422575 |
| 880 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00015667998 |
| 5,492 | Mixed-Approach Algorithms for Transitive Closure | 1991 | PODS | 5.4771871e-05 |