Avoiding Cartesian Products in Programs for Multiple Joins (Extended Abstract)
Summary: Shows that for every join expression there exists an equivalent Cartesian-product-free (CPF) expression that yields a program using joins, semijoins, and projections with cost within a constant factor of optimal. Requires no data-instance restrictions, unlike prior work. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Shinichi Morishita (IBM; Stanford University)
BibTeX Citation
@inproceedings{morishita_pods92,
address = {New York, NY, USA},
series = {{PODS} '92},
title = {{Avoiding Cartesian Products in Programs for Multiple Joins (Extended Abstract)}},
url = {https://dl.acm.org/doi/10.1145/137097.137911},
doi = {10.1145/137097.137911},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Morishita, Shinichi},
year = {1992}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 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 |
| 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 |
| 8,294 | On the Optimality of Strategies for Multiple Joins | 1990 | PODS | 5.4574671e-05 |
| 8,301 | The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract) | 1986 | PODS | 5.4574671e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,104 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB |
| 2 | 18 | How Good Are Query Optimizers, Really? | 2016 | VLDB |
| 3 | 3,656 | Bypassing Joins in Disjunctive Queries | 1995 | VLDB |
| 4 | 1,286 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD |
| 5 | 6,164 | On the Complexity of Generating Optimal Plans with Cross Products (extended abstract) | 1997 | PODS |
| 6 | 7,858 | Optimization of Multiple-Relation Multiple-Disjunct Queries | 1988 | PODS |
| 7 | 7,882 | Efficiently Computing Join Orders with Heuristic Search | 2023 | SIGMOD |
| 8 | 3,813 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD |
| 9 | 774 | Rapid Bushy Join-order Optimization with Cartesian Products | 1996 | SIGMOD |
| 10 | 8,294 | On the Optimality of Strategies for Multiple Joins | 1990 | PODS |