Database Paper Browser

Back to papers

Debunking the Myth of Join Ordering: Toward Robust SQL Analytics

Summary: Robust Predicate Transfer (RPT) for acyclic joins; introduces LargestRoot and SafeSubjoin to achieve provable robustness to arbitrary join orders. Implemented in DuckDB; evaluated on TPC-H/JOB/TPC-DS/DSB, delivering up to 1.6x robustness improvement and ~1.5x end-to-end speedup. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7217
Venue
SIGMOD
Year
2025
Pagerank
4.8199209e-05
Overall Rank
7,122 | 50.51%
DOI
10.1145/3725283

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Rank Citing Paper Year Venue Pagerank
7,465 Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees 2025 SIGMOD 4.7186055e-05
7,887 SQLStorm: Taking Database Benchmarking into the LLM Era 2025 VLDB 4.6218382e-05
8,587 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 4.4853975e-05
8,711 Parachute: Single-Pass Bi-Directional Information Passing 2025 VLDB 4.4582346e-05
9,746 Still Asking: How Good Are Query Optimizers, Really? 2025 VLDB 4.2856385e-05
9,987 I Can't Believe It's Not Yannakakis: Pragmatic Bitmap Filters in Microsoft SQL Server 2026 CIDR 4.1905499e-05
10,241 Robust Predicate Transfer with Dynamic Execution 2026 VLDB 4.1905499e-05
10,271 OBELISK: Efficient Offline Query Planning with Bayesian Optimization-Informed Language Model Reasoning 2026 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 50 of 50 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.0040465394
30 Hashing Methods and Relational Algebra Operations 1984 VLDB 0.00078665259
71 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059446482
100 On the Propagation of Errors in the Size of Join Results 1991 SIGMOD 0.00050033475
116 Eddies: Continuously Adaptive Query Processing 2000 SIGMOD 0.00046191288
185 DuckDB: an Embeddable Analytical Database 2019 SIGMOD 0.00036529607
203 Learned Cardinalities: Estimating Correlated Joins with Deep Learning 2019 CIDR 0.00034868567
221 Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans 1998 SIGMOD 0.00033182072
341 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00026850764
606 DeepDB: Learn from Data, not from Queries! 2020 VLDB 0.00019251186
610 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00019204048
650 Robust Query Processing through Progressive Optimization 2004 SIGMOD 0.0001865144
680 Towards a Robust Query Optimizer: A Principled and Practical Approach 2005 SIGMOD 0.00018193263
752 Deep Unsupervised Cardinality Estimation 2020 VLDB 0.00017138049
905 NeuroCard: One Cardinality Estimator for All Tables 2021 VLDB 0.00015423174
1,239 Selectivity Estimation for Range Predicates using Lightweight Models 2019 VLDB 0.00013091459
1,268 Proactive Re-Optimization 2005 SIGMOD 0.00012914584
1,334 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00012543633
1,344 Dynamic Programming Strikes Back 2008 SIGMOD 0.00012477274
1,452 What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? 2017 PODS 0.00011922523
1,727 QuickSel: Quick Selectivity Learning with Mixture Models 2020 SIGMOD 0.00010731889
1,825 Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products 2006 VLDB 0.00010392367
1,938 From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System 2015 SIGMOD 0.00010025547
1,948 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 9.9938634e-05
2,187 Least Expected Cost Query Optimization: What Can We Expect? 2002 PODS 9.3429142e-05
2,281 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 9.122455e-05
2,364 Deep Learning Models for Selectivity Estimation of Multi-Attribute Queries 2020 SIGMOD 8.955077e-05
2,769 FLAT: Fast, Lightweight and Accurate Method for Cardinality Estimation 2021 VLDB 8.1512848e-05
2,804 Hypertree Decompositions and Tractable Queries 1999 PODS 8.1039107e-05
2,937 DSB: A Decision Support Benchmark for Workload-Driven and Traditional Database Systems 2021 VLDB 7.8552033e-05
3,492 Fauce: Fast and Accurate Deep Ensembles with Uncertainty for Cardinality Estimation 2021 VLDB 7.0435484e-05
3,924 A Unified Deep Model of Learning from both Data and Queries for Cardinality Estimation 2021 SIGMOD 6.6227223e-05
4,272 Looking Ahead Makes Query Plans Robust: Making the Initial Case with In-Memory Star Schema Data Warehouse Workloads 2017 VLDB 6.2933353e-05
4,342 Identifying Robust Plans through Plan Diagram Reduction 2008 VLDB 6.2680535e-05
4,352 Astrid: Accurate Selectivity Estimation for String Predicates using Deep Learning 2021 VLDB 6.2542257e-05
4,466 Robust Join Processing with Diamond Hardened Joins 2024 VLDB 6.1545841e-05
5,476 On the Production of Anorexic Plan Diagrams 2007 VLDB 5.4866057e-05
5,772 Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries 2024 CIDR 5.3313794e-05
6,294 Free Join: Unifying Worst-Case Optimal and Traditional Joins 2023 SIGMOD 5.1202075e-05
6,561 On the Stability of Plan Costs and the Costs of Plan Stability 2010 VLDB 5.0055336e-05
6,763 Robustness Metrics for Relational Query Execution Plans 2018 VLDB 4.9291549e-05
7,009 Is Your Learned Query Optimizer Behaving As You Expect? A Machine Learning Perspective 2024 VLDB 4.8597992e-05
7,337 Join Size Bounds using l_p-Norms on Degree Sequences 2024 PODS 4.7532633e-05
7,465 Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees 2025 SIGMOD 4.7186055e-05
8,130 Robust Query Processing: Mission Possible 2020 VLDB 4.5746794e-05
8,168 Progressive Optimization in a Shared-Nothing Parallel Database 2007 SIGMOD 4.5674166e-05
8,440 PARQO: Penalty-Aware Robust Plan Selection in Query Optimization 2024 VLDB 4.505741e-05
9,191 POLAR: Adaptive and Non-invasive Join Order Selection via Plans of Least Resistance 2024 VLDB 4.3738237e-05
9,662 Efficient Query Re-optimization with Judicious Subquery Selections 2023 SIGMOD 4.3056334e-05
10,384 Data Chunk Compaction in Vectorized Execution 2025 SIGMOD 4.1905499e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
12,199 Efficient Rank Join with Aggregation Constraints 2011 VLDB 4.1905499e-05
11,710 Improving Join Reorderability with Compensation Operators 2018 SIGMOD 4.1905499e-05
1,344 Dynamic Programming Strikes Back 2008 SIGMOD 0.00012477274
8,149 Efficiently Computing Join Orders with Heuristic Search 2023 SIGMOD 4.5715614e-05
2,281 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 9.122455e-05
7,165 Ranked Enumeration of Join Queries with Projections 2022 VLDB 4.807833e-05
4,734 Query Simplification: Graceful Degradation for Join-Order Optimization 2009 SIGMOD 5.9553181e-05
4,526 Simplicity Done Right for Join Ordering 2021 CIDR 6.1079584e-05
4,466 Robust Join Processing with Diamond Hardened Joins 2024 VLDB 6.1545841e-05
10,241 Robust Predicate Transfer with Dynamic Execution 2026 VLDB 4.1905499e-05