Back to papers
Robust Join Processing with Diamond Hardened Joins
Summary: Identifies the “diamond problem”—joins that blow up redundant intermediate results (common in graph workloads and JOB)—and proposes Diamond Hardened Joins that split joins into Lookup & Expand suboperators. Reordering these avoids huge intermediates, yielding up to 500× speedups without the constant overheads of worst-case-optimal approaches and while preserving performance on regular TPC‑H/JOB queries.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13536
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 6.1604282e-05
- Overall Rank
- 4,465 | 68.94%
- DOI
-
10.14778/3681954.3681995
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 7,126 |
Debunking the Myth of Join Ordering: Toward Robust SQL Analytics |
2025 |
SIGMOD |
4.8232367e-05 |
| 7,467 |
Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees |
2025 |
SIGMOD |
4.7218691e-05 |
| 8,034 |
Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores |
2025 |
VLDB |
4.6010599e-05 |
| 8,275 |
Adaptive Factorization Using Linear-Chained Hash Tables |
2025 |
CIDR |
4.5439841e-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 |
| 8,781 |
Accelerate Distributed Joins with Predicate Transfer |
2025 |
SIGMOD |
4.4534753e-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,104 |
Query Optimization for Database-Returning Queries |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,238 |
TurboLynx: Schemaless Graph Engine Strikes Back for General-Purpose Analytics |
2026 |
VLDB |
4.1945683e-05 |
| 10,241 |
Robust Predicate Transfer with Dynamic Execution |
2026 |
VLDB |
4.1945683e-05 |
| 10,284 |
FlowLog: Efficient and Extensible Datalog via Incrementality |
2026 |
VLDB |
4.1945683e-05 |
| 10,360 |
Soft and Constrained Hypertree Width |
2025 |
PODS |
4.1945683e-05 |
| 10,488 |
HoneyComb: A Parallel Worst-Case Optimal Join on Multicores |
2025 |
SIGMOD |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 19 of 19 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 60 |
Efficiently Compiling Efficient Query Plans for Modern Hardware |
2011 |
VLDB |
0.00064439773 |
| 185 |
DuckDB: an Embeddable Analytical Database |
2019 |
SIGMOD |
0.00036538405 |
| 248 |
Eager Aggregation and Lazy Aggregation |
1995 |
VLDB |
0.00030785339 |
| 502 |
Worst-case Optimal Join Algorithms |
2012 |
PODS |
0.00021526612 |
| 735 |
Umbra: A Disk-Based System with In-Memory Performance |
2020 |
CIDR |
0.00017452467 |
| 1,056 |
The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates |
2017 |
SIGMOD |
0.0001441128 |
| 1,341 |
Dynamic Programming Strikes Back |
2008 |
SIGMOD |
0.00012486285 |
| 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 |
| 2,200 |
LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms |
2016 |
VLDB |
9.3075881e-05 |
| 2,275 |
Adopting Worst-Case Optimal Joins in Relational Database Systems |
2020 |
VLDB |
9.1262202e-05 |
| 3,511 |
Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs |
2022 |
VLDB |
7.0254052e-05 |
| 3,668 |
The LDBC Social Network Benchmark: Business Intelligence Workload |
2023 |
VLDB |
6.8591612e-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 |
| 5,718 |
Conjunctive Queries with Comparisons |
2022 |
SIGMOD |
5.3552123e-05 |
| 5,765 |
Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries |
2024 |
CIDR |
5.336442e-05 |
| 5,967 |
Change Propagation Without Joins |
2023 |
VLDB |
5.250976e-05 |
| 6,305 |
Free Join: Unifying Worst-Case Optimal and Traditional Joins |
2023 |
SIGMOD |
5.1209718e-05 |
| 6,524 |
The 3D Hash Join: Building On Non-Unique Join Attributes |
2022 |
CIDR |
5.0274964e-05 |
| 7,250 |
A Scalable and Generic Approach to Range Joins |
2022 |
VLDB |
4.78908e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,523 |
Simplicity Done Right for Join Ordering |
2021 |
CIDR |
6.1135504e-05 |
| 71 |
How Good Are Query Optimizers, Really? |
2016 |
VLDB |
0.00059038975 |
| 3,515 |
Scalable Computation of Acyclic Joins (Extended Abstract) |
2006 |
PODS |
7.0220813e-05 |
| 7,126 |
Debunking the Myth of Join Ordering: Toward Robust SQL Analytics |
2025 |
SIGMOD |
4.8232367e-05 |
| 3,898 |
Efficient Join Algorithms For Large Database Tables in a Multi-GPU Environment |
2021 |
VLDB |
6.6551268e-05 |
| 1,063 |
Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines |
1990 |
VLDB |
0.00014362773 |
| 4,738 |
Query Simplification: Graceful Degradation for Join-Order Optimization |
2009 |
SIGMOD |
5.9600502e-05 |
| 6,647 |
Fast Join Project Query Evaluation using Matrix Multiplication |
2020 |
SIGMOD |
4.9772122e-05 |
| 1,619 |
Adaptive Optimization of Very Large Join Queries |
2018 |
SIGMOD |
0.00011111678 |
| 2,275 |
Adopting Worst-Case Optimal Joins in Relational Database Systems |
2020 |
VLDB |
9.1262202e-05 |