Title :
Parallel hash-based join algorithms for a shared-everything environment
Author :
Martin, T. Patrick ; Larson, Per-Åke ; Deshpande, Vinay
Author_Institution :
Dept. of Comput. & Inf. Sci., Queen´´s Univ., Kingston, Ont., Canada
fDate :
10/1/1994 12:00:00 AM
Abstract :
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
Keywords :
database theory; parallel algorithms; performance evaluation; query processing; relational databases; shared memory systems; GRACE algorithm; algorithm performance; cost models; general purpose shared-memory multiprocessor; hashed loops algorithm; hybrid algorithm; parallel hash-based join algorithms; query processing; relational database; shared-everything environment; Algorithm design and analysis; Computer science; Costs; Database systems; Multiprocessing systems; Parallel algorithms; Parallel processing; Partitioning algorithms; Query processing; Relational databases;
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
