Improving Join Reorderability with Compensation Operators
Summary: Proposes compensation operators to enable join reorderability for inner-joins, single-sided outer-joins, and/or antijoins. Overcomes non-associativity and enumeration gaps in prior work, enabling complete search of the join order space for this class and beating leading approaches. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. TaiNing Wang
- 2. Chee-Yong Chan
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 9 of 9 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 |
| 100 | Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers | 1987 | VLDB | 0.00049624696 |
| 901 | Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins | 1990 | SIGMOD | 0.00015487777 |
| 1,341 | Dynamic Programming Strikes Back | 2008 | SIGMOD | 0.00012486285 |
| 1,451 | Extending the Algebraic Framework of Query Processing to Handle Outerjoins | 1984 | VLDB | 0.00011922302 |
| 2,785 | Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs | 2013 | VLDB | 8.1286814e-05 |
| 3,339 | Hypergraph based reorderings of outer join queries with complex predicates | 1995 | SIGMOD | 7.2038026e-05 |
| 3,850 | Canonical Abstraction for Outerjoin Optimization | 2004 | SIGMOD | 6.7059122e-05 |
| 4,938 | On the Correct and Complete Enumeration of the Core Search Space | 2013 | SIGMOD | 5.8184655e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,474 | Solving the Join Ordering Problem via Mixed Integer Linear Programming | 2017 | SIGMOD | 7.0625972e-05 |
| 8,164 | Efficiently Computing Join Orders with Heuristic Search | 2023 | SIGMOD | 4.5718104e-05 |
| 3,850 | Canonical Abstraction for Outerjoin Optimization | 2004 | SIGMOD | 6.7059122e-05 |
| 4,523 | Simplicity Done Right for Join Ordering | 2021 | CIDR | 6.1135504e-05 |
| 1,619 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD | 0.00011111678 |
| 4,738 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD | 5.9600502e-05 |
| 3,339 | Hypergraph based reorderings of outer join queries with complex predicates | 1995 | SIGMOD | 7.2038026e-05 |
| 1,451 | Extending the Algebraic Framework of Query Processing to Handle Outerjoins | 1984 | VLDB | 0.00011922302 |
| 8,784 | SQL Query Optimization: Reordering for a General Class of Queries | 1996 | SIGMOD | 4.4527694e-05 |
| 901 | Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins | 1990 | SIGMOD | 0.00015487777 |