A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment.

A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment. David J. DeWitt Donovan A. Schneider ACM SIGMOD Conference 1989 18 2 110 121 In this paper we analyze and compare four parallel join algorithms. Grace and Hybrid hash represent the class of hash-based join methods, Simple hash represents a looping algorithm with hashing, and our last algorithm is the more traditional sort-merge.