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
7216
Venue
SIGMOD
Year
2025
Pagerank
4.8232367e-05
Overall Rank
7,126 | 50.43%
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,467 Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees 2025 SIGMOD 4.7218691e-05
8,207 SQLStorm: Taking Database Benchmarking into the LLM Era 2025 VLDB 4.5583637e-05
8,589 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 4.4897014e-05
8,718 Parachute: Single-Pass Bi-Directional Information Passing 2025 VLDB 4.4612599e-05
9,747 Still Asking: How Good Are Query Optimizers, Really? 2025 VLDB 4.2897489e-05
9,988 I Can't Believe It's Not Yannakakis: Pragmatic Bitmap Filters in Microsoft SQL Server 2026 CIDR 4.1945683e-05
10,241 Robust Predicate Transfer with Dynamic Execution 2026 VLDB 4.1945683e-05
10,271 OBELISK: Efficient Offline Query Planning with Bayesian Optimization-Informed Language Model Reasoning 2026 VLDB 4.1945683e-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.0040449103
30 Hashing Methods and Relational Algebra Operations 1984 VLDB 0.00078672446
71 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059038975
99 On the Propagation of Errors in the Size of Join Results 1991 SIGMOD 0.00050022914
115 Eddies: Continuously Adaptive Query Processing 2000 SIGMOD 0.00046221215
185 DuckDB: an Embeddable Analytical Database 2019 SIGMOD 0.00036538405
204 Learned Cardinalities: Estimating Correlated Joins with Deep Learning 2019 CIDR 0.00034784455
220 Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans 1998 SIGMOD 0.00033194808
342 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00026795977
608 DeepDB: Learn from Data, not from Queries! 2020 VLDB 0.00019235898
613 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00019181325
650 Robust Query Processing through Progressive Optimization 2004 SIGMOD 0.00018659177
684 Towards a Robust Query Optimizer: A Principled and Practical Approach 2005 SIGMOD 0.00018179769
758 Deep Unsupervised Cardinality Estimation 2020 VLDB 0.0001706608
910 NeuroCard: One Cardinality Estimator for All Tables 2021 VLDB 0.00015423056
1,254 Selectivity Estimation for Range Predicates using Lightweight Models 2019 VLDB 0.00013027411
1,272 Proactive Re-Optimization 2005 SIGMOD 0.00012920076
1,333 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00012523806
1,341 Dynamic Programming Strikes Back 2008 SIGMOD 0.00012486285
1,442 What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? 2017 PODS 0.00011956109
1,737 QuickSel: Quick Selectivity Learning with Mixture Models 2020 SIGMOD 0.00010720294
1,826 Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products 2006 VLDB 0.00010400425
1,939 From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System 2015 SIGMOD 0.00010025655
1,953 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 9.9665955e-05
2,180 Least Expected Cost Query Optimization: What Can We Expect? 2002 PODS 9.3481968e-05
2,275 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 9.1262202e-05
2,364 Deep Learning Models for Selectivity Estimation of Multi-Attribute Queries 2020 SIGMOD 8.9554751e-05
2,762 FLAT: Fast, Lightweight and Accurate Method for Cardinality Estimation 2021 VLDB 8.1585394e-05
2,796 Hypertree Decompositions and Tractable Queries 1999 PODS 8.1112658e-05
2,985 DSB: A Decision Support Benchmark for Workload-Driven and Traditional Database Systems 2021 VLDB 7.7795847e-05
3,499 Fauce: Fast and Accurate Deep Ensembles with Uncertainty for Cardinality Estimation 2021 VLDB 7.0376445e-05
3,924 A Unified Deep Model of Learning from both Data and Queries for Cardinality Estimation 2021 SIGMOD 6.6271553e-05
4,276 Looking Ahead Makes Query Plans Robust: Making the Initial Case with In-Memory Star Schema Data Warehouse Workloads 2017 VLDB 6.2976602e-05
4,348 Identifying Robust Plans through Plan Diagram Reduction 2008 VLDB 6.2660237e-05
4,359 Astrid: Accurate Selectivity Estimation for String Predicates using Deep Learning 2021 VLDB 6.2569955e-05
4,465 Robust Join Processing with Diamond Hardened Joins 2024 VLDB 6.1604282e-05
5,466 On the Production of Anorexic Plan Diagrams 2007 VLDB 5.4909203e-05
5,765 Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries 2024 CIDR 5.336442e-05
6,305 Free Join: Unifying Worst-Case Optimal and Traditional Joins 2023 SIGMOD 5.1209718e-05
6,561 On the Stability of Plan Costs and the Costs of Plan Stability 2010 VLDB 5.0099895e-05
6,763 Robustness Metrics for Relational Query Execution Plans 2018 VLDB 4.9338479e-05
7,008 Is Your Learned Query Optimizer Behaving As You Expect? A Machine Learning Perspective 2024 VLDB 4.8643538e-05
7,344 Join Size Bounds using l_p-Norms on Degree Sequences 2024 PODS 4.7565607e-05
7,467 Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees 2025 SIGMOD 4.7218691e-05
8,127 Robust Query Processing: Mission Possible 2020 VLDB 4.579056e-05
8,165 Progressive Optimization in a Shared-Nothing Parallel Database 2007 SIGMOD 4.5717277e-05
8,448 PARQO: Penalty-Aware Robust Plan Selection in Query Optimization 2024 VLDB 4.5100508e-05
9,187 POLAR: Adaptive and Non-invasive Join Order Selection via Plans of Least Resistance 2024 VLDB 4.3780059e-05
9,662 Efficient Query Re-optimization with Judicious Subquery Selections 2023 SIGMOD 4.3097631e-05
10,372 Data Chunk Compaction in Vectorized Execution 2025 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
12,191 Efficient Rank Join with Aggregation Constraints 2011 VLDB 4.1945683e-05
11,705 Improving Join Reorderability with Compensation Operators 2018 SIGMOD 4.1945683e-05
1,341 Dynamic Programming Strikes Back 2008 SIGMOD 0.00012486285
8,164 Efficiently Computing Join Orders with Heuristic Search 2023 SIGMOD 4.5718104e-05
2,275 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 9.1262202e-05
7,166 Ranked Enumeration of Join Queries with Projections 2022 VLDB 4.8124491e-05
4,738 Query Simplification: Graceful Degradation for Join-Order Optimization 2009 SIGMOD 5.9600502e-05
4,523 Simplicity Done Right for Join Ordering 2021 CIDR 6.1135504e-05
4,465 Robust Join Processing with Diamond Hardened Joins 2024 VLDB 6.1604282e-05
10,241 Robust Predicate Transfer with Dynamic Execution 2026 VLDB 4.1945683e-05