On the Optimality of Strategies for Multiple Joins
Summary: Characterizes when linear (left-deep) join orders and avoiding Cartesian products suffice for globally optimal multi-join evaluation. Proves three conditions: optimal linear plans can avoid Cartesian products; an optimal no-Cartesian plan exists; and sometimes an optimal plan is both linear and no-Cartesian, certifying restricted-space optimality. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Y.C. Tay (National University of Singapore)
BibTeX Citation
@inproceedings{tay_pods90,
address = {New York, NY, USA},
series = {{PODS} '90},
title = {{On the Optimality of Strategies for Multiple Joins}},
url = {https://dl.acm.org/doi/10.1145/298514.298550},
doi = {10.1145/298514.298550},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Tay, Y.C.},
year = {1990}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13,084 | Avoiding Cartesian Products in Programs for Multiple Joins (Extended Abstract) | 1992 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1 | Access Path Selection in a Relational Database Management System | 1979 | SIGMOD | 0.0024089429 |
| 7 | Implementation Techniques For Main Memory Database Systems | 1984 | SIGMOD | 0.00083340894 |
| 143 | Optimization of Nonrecursive Queries | 1986 | VLDB | 0.0002959213 |
| 463 | Optimization of Large Join Queries | 1988 | SIGMOD | 0.00018064961 |
| 698 | Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques | 1989 | SIGMOD | 0.00014879675 |
| 3,011 | Design and Evaluation of Parallel Pipelined Join Algorithms | 1987 | SIGMOD | 7.8532781e-05 |
| 8,628 | Retrieval Performance Versus Disc Space Utilization on WORM Optical Discs | 1989 | SIGMOD | 5.3968286e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,909 | Improving Join Reorderability with Compensation Operators | 2018 | SIGMOD |
| 2 | 143 | Optimization of Nonrecursive Queries | 1986 | VLDB |
| 3 | 774 | Rapid Bushy Join-order Optimization with Cartesian Products | 1996 | SIGMOD |
| 4 | 7,882 | Efficiently Computing Join Orders with Heuristic Search | 2023 | SIGMOD |
| 5 | 1,286 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD |
| 6 | 97 | Efficient Optimization of a Class of Relational Expressions | 1978 | SIGMOD |
| 7 | 2,465 | Optimization of Queries with User-defined Predicates | 1996 | VLDB |
| 8 | 2,104 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB |
| 9 | 7,858 | Optimization of Multiple-Relation Multiple-Disjunct Queries | 1988 | PODS |
| 10 | 13,084 | Avoiding Cartesian Products in Programs for Multiple Joins (Extended Abstract) | 1992 | PODS |