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: 13724
Venue: VLDB
Year: 2024
Pagerank: 7.2465862e-05
Overall Rank: 3,622 | 75.16%
DOI: 10.14778/3681954.3681995

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 17 of 17 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
5,529	Debunking the Myth of Join Ordering: Toward Robust SQL Analytics	2025	SIGMOD	6.18591e-05
6,434	Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees	2025	SIGMOD	5.8799421e-05
6,444	Output-Optimal Algorithms for Join-Aggregate Queries	2025	PODS	5.8774519e-05
7,386	Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores	2025	VLDB	5.6273882e-05
8,074	Parachute: Single-Pass Bi-Directional Information Passing	2025	VLDB	5.4929961e-05
8,232	Adaptive Factorization Using Linear-Chained Hash Tables	2025	CIDR	5.4612012e-05
8,721	Accelerate Distributed Joins with Predicate Transfer	2025	SIGMOD	5.3772617e-05
9,920	Still Asking: How Good Are Query Optimizers, Really?	2025	VLDB	5.1955087e-05
10,135	I Can't Believe It's Not Yannakakis: Pragmatic Bitmap Filters in Microsoft SQL Server	2026	CIDR	5.093636e-05
10,237	Factorized and Vectorized Execution: Optimizing Analytical and Semantic Queries over Relations	2026	SIGMOD	5.093636e-05
10,296	Succinct Structure Representations for Efficient Query Optimization	2026	SIGMOD	5.093636e-05
10,394	Query Optimization for Database-Returning Queries	2026	SIGMOD	5.093636e-05
10,526	TurboLynx: Schemaless Graph Engine Strikes Back for General-Purpose Analytics	2026	VLDB	5.093636e-05
10,529	Robust Predicate Transfer with Dynamic Execution	2026	VLDB	5.093636e-05
10,582	FlowLog: Efficient and Extensible Datalog via Incrementality	2026	VLDB	5.093636e-05
10,653	Soft and Constrained Hypertree Width	2025	PODS	5.093636e-05
10,765	HoneyComb: A Parallel Worst-Case Optimal Join on Multicores	2025	SIGMOD	5.093636e-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
23	Efficiently Compiling Efficient Query Plans for Modern Hardware	2011	VLDB	0.00054886415
103	DuckDB: an Embeddable Analytical Database	2019	SIGMOD	0.00034161428
206	Eager Aggregation and Lazy Aggregation	1995	VLDB	0.00025092273
411	Worst-case Optimal Join Algorithms	2012	PODS	0.00018902089
422	Umbra: A Disk-Based System with In-Memory Performance	2020	CIDR	0.00018732744
816	The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates	2017	SIGMOD	0.00013827772
1,013	Dynamic Programming Strikes Back	2008	SIGMOD	0.00012652549
1,298	Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products	2006	VLDB	0.00011259156
1,563	LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms	2016	VLDB	0.00010352314
1,740	Adopting Worst-Case Optimal Joins in Relational Database Systems	2020	VLDB	9.875587e-05
3,018	The LDBC Social Network Benchmark: Business Intelligence Workload	2023	VLDB	7.8473755e-05
3,070	Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs	2022	VLDB	7.7900444e-05
3,571	Looking Ahead Makes Query Plans Robust: Making the Initial Case with In-Memory Star Schema Data Warehouse Workloads	2017	VLDB	7.2991953e-05
4,553	Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries	2024	CIDR	6.6346951e-05
4,575	Conjunctive Queries with Comparisons	2022	SIGMOD	6.6223692e-05
4,985	Change Propagation Without Joins	2023	VLDB	6.412102e-05
5,781	Free Join: Unifying Worst-Case Optimal and Traditional Joins	2023	SIGMOD	6.0910397e-05
6,207	The 3D Hash Join: Building On Non-Unique Join Attributes	2022	CIDR	5.9429869e-05
7,207	A Scalable and Generic Approach to Range Joins	2022	VLDB	5.6727648e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,959	Simplicity Done Right for Join Ordering	2021	CIDR
2	18	How Good Are Query Optimizers, Really?	2016	VLDB
3	3,617	Scalable Computation of Acyclic Joins (Extended Abstract)	2006	PODS
4	5,529	Debunking the Myth of Join Ordering: Toward Robust SQL Analytics	2025	SIGMOD
5	3,134	Efficient Join Algorithms For Large Database Tables in a Multi-GPU Environment	2021	VLDB
6	904	Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines	1990	VLDB
7	3,813	Query Simplification: Graceful Degradation for Join-Order Optimization	2009	SIGMOD
8	5,364	Fast Join Project Query Evaluation using Matrix Multiplication	2020	SIGMOD
9	1,286	Adaptive Optimization of Very Large Join Queries	2018	SIGMOD
10	1,740	Adopting Worst-Case Optimal Joins in Relational Database Systems	2020	VLDB