Parallel Hash-Based Join Algorithms for a Shared-Everything Environment
- Per-Ake Larson ,
- T.Patrick Martin ,
- Vinay Deshpande ,
- Paul Larson
Published by Institute of Electrical and Electronics Engineers, Inc.
We analyze the costs, and describe 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.
© 1994 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.