The Community for Technology Leaders
RSS Icon
Issue No.05 - October (1994 vol.6)
pp: 750-763
<p>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.</p>
query processing; relational databases; database theory; shared memory systems; performance evaluation; parallel algorithms; parallel hash-based join algorithms; shared-everything environment; general purpose shared-memory multiprocessor; hashed loops algorithm; GRACE algorithm; hybrid algorithm; cost models; algorithm performance; relational database; query processing
T.P. Martin, P.-Å. Larson, V. Deshpande, "Parallel Hash-Based Join Algorithms for a Shared-Everything Environment", IEEE Transactions on Knowledge & Data Engineering, vol.6, no. 5, pp. 750-763, October 1994, doi:10.1109/69.317705
42 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool