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
- 13537
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 6.1545841e-05
- Overall Rank
- 4,466 | 68.97%
- 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,122 |
Debunking the Myth of Join Ordering: Toward Robust SQL Analytics |
2025 |
SIGMOD |
4.8199209e-05 |
| 7,465 |
Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees |
2025 |
SIGMOD |
4.7186055e-05 |
| 8,035 |
Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores |
2025 |
VLDB |
4.5967078e-05 |
| 8,271 |
Adaptive Factorization Using Linear-Chained Hash Tables |
2025 |
CIDR |
4.539672e-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 |
| 8,777 |
Accelerate Distributed Joins with Predicate Transfer |
2025 |
SIGMOD |
4.4492064e-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,104 |
Query Optimization for Database-Returning Queries |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,238 |
TurboLynx: Schemaless Graph Engine Strikes Back for General-Purpose Analytics |
2026 |
VLDB |
4.1905499e-05 |
| 10,241 |
Robust Predicate Transfer with Dynamic Execution |
2026 |
VLDB |
4.1905499e-05 |
| 10,296 |
FlowLog: Efficient and Extensible Datalog via Incrementality |
2026 |
VLDB |
4.1905499e-05 |
| 10,372 |
Soft and Constrained Hypertree Width |
2025 |
PODS |
4.1905499e-05 |
| 10,498 |
HoneyComb: A Parallel Worst-Case Optimal Join on Multicores |
2025 |
SIGMOD |
4.1905499e-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 |
| 59 |
Efficiently Compiling Efficient Query Plans for Modern Hardware |
2011 |
VLDB |
0.0006445664 |
| 185 |
DuckDB: an Embeddable Analytical Database |
2019 |
SIGMOD |
0.00036529607 |
| 249 |
Eager Aggregation and Lazy Aggregation |
1995 |
VLDB |
0.00030773137 |
| 503 |
Worst-case Optimal Join Algorithms |
2012 |
PODS |
0.00021517145 |
| 729 |
Umbra: A Disk-Based System with In-Memory Performance |
2020 |
CIDR |
0.00017448059 |
| 1,054 |
The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates |
2017 |
SIGMOD |
0.00014397587 |
| 1,344 |
Dynamic Programming Strikes Back |
2008 |
SIGMOD |
0.00012477274 |
| 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 |
| 2,201 |
LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms |
2016 |
VLDB |
9.3042485e-05 |
| 2,281 |
Adopting Worst-Case Optimal Joins in Relational Database Systems |
2020 |
VLDB |
9.122455e-05 |
| 3,516 |
Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs |
2022 |
VLDB |
7.018912e-05 |
| 3,670 |
The LDBC Social Network Benchmark: Business Intelligence Workload |
2023 |
VLDB |
6.8557811e-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 |
| 5,728 |
Conjunctive Queries with Comparisons |
2022 |
SIGMOD |
5.350072e-05 |
| 5,772 |
Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries |
2024 |
CIDR |
5.3313794e-05 |
| 5,973 |
Change Propagation Without Joins |
2023 |
VLDB |
5.2459364e-05 |
| 6,294 |
Free Join: Unifying Worst-Case Optimal and Traditional Joins |
2023 |
SIGMOD |
5.1202075e-05 |
| 6,523 |
The 3D Hash Join: Building On Non-Unique Join Attributes |
2022 |
CIDR |
5.0228804e-05 |
| 7,247 |
A Scalable and Generic Approach to Range Joins |
2022 |
VLDB |
4.7846107e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 2,051 |
Optimization of Multi-Way Join Queries for Parallel Execution |
1991 |
VLDB |
9.6871984e-05 |
| 71 |
How Good Are Query Optimizers, Really? |
2016 |
VLDB |
0.00059446482 |
| 3,519 |
Scalable Computation of Acyclic Joins (Extended Abstract) |
2006 |
PODS |
7.0181381e-05 |
| 7,122 |
Debunking the Myth of Join Ordering: Toward Robust SQL Analytics |
2025 |
SIGMOD |
4.8199209e-05 |
| 3,899 |
Efficient Join Algorithms For Large Database Tables in a Multi-GPU Environment |
2021 |
VLDB |
6.6513982e-05 |
| 1,063 |
Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines |
1990 |
VLDB |
0.00014352292 |
| 4,734 |
Query Simplification: Graceful Degradation for Join-Order Optimization |
2009 |
SIGMOD |
5.9553181e-05 |
| 6,647 |
Fast Join Project Query Evaluation using Matrix Multiplication |
2020 |
SIGMOD |
4.9729424e-05 |
| 1,621 |
Adaptive Optimization of Very Large Join Queries |
2018 |
SIGMOD |
0.00011105663 |
| 2,281 |
Adopting Worst-Case Optimal Joins in Relational Database Systems |
2020 |
VLDB |
9.122455e-05 |