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)
Incoming Non-self Citations Over Time
Authors
- 1. Altan Birler (Technical University of Munich)
- 2. Alfons Kemper (Technical University of Munich)
- 3. Thomas Neumann (Technical University of Munich)
BibTeX Citation
@article{birler_vldb24,
title = {{Robust Join Processing with Diamond Hardened Joins}},
author = {Birler, Altan and Kemper, Alfons and Neumann, Thomas},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {11},
pages = {3215--3228},
doi = {10.14778/3681954.3681995},
url = {https://doi.org/10.14778/3681954.3681995},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 23 of 23 citing papers.
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,494 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS |
| 2 | 15 | How Good Are Query Optimizers, Really? | 2016 | VLDB |
| 3 | 3,661 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS |
| 4 | 4,945 | Debunking the Myth of Join Ordering: Toward Robust SQL Analytics | 2025 | SIGMOD |
| 5 | 2,887 | Efficient Join Algorithms For Large Database Tables in a Multi-GPU Environment | 2021 | VLDB |
| 6 | 920 | Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines | 1990 | VLDB |
| 7 | 3,800 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD |
| 8 | 5,491 | Fast Join Project Query Evaluation using Matrix Multiplication | 2020 | SIGMOD |
| 9 | 1,185 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD |
| 10 | 1,596 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB |