DBScholar

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
h09e73750e6eb1fa9
Venue
VLDB
Year
2024
Pagerank
7.5598778e-05
Overall Rank
3,165 | 78.79%
DOI
10.14778/3681954.3681995
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

Authors

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.

Rank Citing Paper Year Venue Pagerank
4,971 Debunking the Myth of Join Ordering: Toward Robust SQL Analytics 2025 SIGMOD 6.3209003e-05
5,911 Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees 2025 SIGMOD 5.9338021e-05
6,585 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 5.7238683e-05
6,826 Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores 2025 VLDB 5.6566963e-05
7,782 Adaptive Factorization Using Linear-Chained Hash Tables 2025 CIDR 5.4368388e-05
7,827 Parachute: Single-Pass Bi-Directional Information Passing 2025 VLDB 5.4297836e-05
8,291 Accelerate Distributed Joins with Predicate Transfer 2025 SIGMOD 5.3445863e-05
9,991 HoneyComb: A Parallel Worst-Case Optimal Join on Multicores 2025 SIGMOD 5.0845476e-05
10,143 Still Asking: How Good Are Query Optimizers, Really? 2025 VLDB 5.0597449e-05
10,435 I Can't Believe It's Not Yannakakis: Pragmatic Bitmap Filters in Microsoft SQL Server 2026 CIDR 4.9605343e-05
10,529 Factorized and Vectorized Execution: Optimizing Analytical and Semantic Queries over Relations 2026 SIGMOD 4.9605343e-05
10,585 Succinct Structure Representations for Efficient Query Optimization 2026 SIGMOD 4.9605343e-05
10,663 Query Optimization for Database-Returning Queries 2026 SIGMOD 4.9605343e-05
10,781 TurboLynx: Schemaless Graph Engine Strikes Back for General-Purpose Analytics 2026 VLDB 4.9605343e-05
10,784 Robust Predicate Transfer with Dynamic Execution 2026 VLDB 4.9605343e-05
10,839 One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans 2026 VLDB 4.9605343e-05
10,903 ReSequel: Robust LLM-assisted Query Rewriting and Optimization using Templatization and Sampling 2026 VLDB 4.9605343e-05
10,913 The Data World Is Not Flat: Efficient Factorized Execution for Relational Systems 2026 VLDB 4.9605343e-05
10,937 Nav-Index: A High-Performance, Adaptive Index for Shortest Path Queries in RDBMS 2026 VLDB 4.9605343e-05
10,954 FlowLog: Efficient and Extensible Datalog via Incrementality 2026 VLDB 4.9605343e-05
11,011 Ultron: History-Based Query Optimization at Databricks 2026 VLDB 4.9605343e-05
11,097 Instance-Optimal Acyclic Joins: From Theory to Systems 2026 VLDB 4.9605343e-05
11,166 Soft and Constrained Hypertree Width 2025 PODS 4.9605343e-05
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.

Rank Cited Paper Year Venue Pagerank
21 Efficiently Compiling Efficient Query Plans for Modern Hardware 2011 VLDB 0.00056737487
71 DuckDB: an Embeddable Analytical Database 2019 SIGMOD 0.00037688945
213 Eager Aggregation and Lazy Aggregation 1995 VLDB 0.00024695393
375 Umbra: A Disk-Based System with In-Memory Performance 2020 CIDR 0.00019660459
397 Worst-case Optimal Join Algorithms 2012 PODS 0.0001911958
815 The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates 2017 SIGMOD 0.00013682594
881 Dynamic Programming Strikes Back 2008 SIGMOD 0.0001324243
1,293 Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products 2006 VLDB 0.00011143846
1,487 LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms 2016 VLDB 0.00010496006
1,603 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 0.00010090639
2,987 Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs 2022 VLDB 7.767043e-05
3,066 The LDBC Social Network Benchmark: Business Intelligence Workload 2023 VLDB 7.6714389e-05
3,602 Looking Ahead Makes Query Plans Robust: Making the Initial Case with In-Memory Star Schema Data Warehouse Workloads 2017 VLDB 7.1572829e-05
4,396 Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries 2024 CIDR 6.6072577e-05
4,527 Conjunctive Queries with Comparisons 2022 SIGMOD 6.5466033e-05
5,034 Free Join: Unifying Worst-Case Optimal and Traditional Joins 2023 SIGMOD 6.2921115e-05
5,080 Change Propagation Without Joins 2023 VLDB 6.2689958e-05
5,169 The 3D Hash Join: Building On Non-Unique Join Attributes 2022 CIDR 6.2335575e-05
7,373 A Scalable and Generic Approach to Range Joins 2022 VLDB 5.5245298e-05
Previous Page 1 / 1 Next

Semantically Similar Papers