Design Trade-offs for a Robust Dynamic Hybrid Hash Join
Summary: Design trade-offs for a robust, dynamic Hybrid Hash Join when input statistics are incomplete; analyzes partitioning, memory utilization, and CPU cost. Proposes a partition lower bound and dynamic insertion, growth, and spill policies; validates in Apache AsterixDB on HDD/SSD/EBS with varying sizes and distributions. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,170 | PolarDB-IMCI: A Cloud-Native HTAP Database System at Alibaba | 2023 | SIGMOD | 5.171601e-05 |
| 7,836 | NOCAP: Near-Optimal Correlation-Aware Partitioning Joins | 2023 | SIGMOD | 4.6380835e-05 |
| 10,635 | Saving Private Hash Join | 2025 | VLDB | 4.1945683e-05 |
| 10,989 | High-Performance Query Processing with NVMe Arrays: Spilling without Killing Performance | 2024 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 15 of 15 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next