11 - Parallel Hash Join Algorithms (CMU Advanced Databases / Spring 2023)
CMU Database Group · 75:52
This CMU lecture argues that for single-node, in-memory two-table joins you should implement a no-partitioning hash join with linear probing and XXHash: radix partitioning and fancy collision schemes can win if perfec...