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
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.0040449103 |
| 387 | Optimization of Large Join Queries | 1988 | SIGMOD | 0.0002471967 |
| 784 | Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques | 1989 | SIGMOD | 0.00016675823 |
| 7,976 | On the Optimality of Strategies for Multiple Joins | 1990 | PODS | 4.613363e-05 |
| 7,984 | The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract) | 1986 | PODS | 4.613363e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,044 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB | 9.6953608e-05 |
| 71 | How Good Are Query Optimizers, Really? | 2016 | VLDB | 0.00059038975 |
| 3,666 | Bypassing Joins in Disjunctive Queries | 1995 | VLDB | 6.8618006e-05 |
| 1,619 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD | 0.00011111678 |
| 6,543 | On the Complexity of Generating Optimal Plans with Cross Products (extended abstract) | 1997 | PODS | 5.0208799e-05 |
| 7,824 | Optimization of Multiple-Relation Multiple-Disjunct Queries | 1988 | PODS | 4.6418459e-05 |
| 8,164 | Efficiently Computing Join Orders with Heuristic Search | 2023 | SIGMOD | 4.5718104e-05 |
| 4,738 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD | 5.9600502e-05 |
| 978 | Rapid Bushy Join-order Optimization with Cartesian Products | 1996 | SIGMOD | 0.00014881073 |
| 7,976 | On the Optimality of Strategies for Multiple Joins | 1990 | PODS | 4.613363e-05 |