Parallel hash-based join algorithms for a shared-everything environment
T. Patrick Martin, Per-Åke Larson, V. Deshpande · IEEE Transactions on Knowledge and Data Engineering · 1994
Analyzes the costs, and describes the implementation, of three hash-based join algorithms for a general purpose shared-memory multiprocessor. The three algorithms considered are the hashed loops, GRACE and hybrid algorithms. We also describe the results of a set of experiments that validate the cost models presented and demonstrate the relative performance of the three algorithms.>