Parallel hash-based join algorithms for a shared-everything environment

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...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on knowledge and data engineering Vol. 6; no. 5; pp. 750 - 763
Main Authors Martin, T.P., Larson, P.-A., Deshpande, V.
Format Journal Article
LanguageEnglish
Published IEEE 01.10.1994
Subjects
Algorithm design and analysis
Computer science
Costs
Database systems
Multiprocessing systems
Parallel algorithms
Parallel processing
Partitioning algorithms
Query processing
Relational databases
Online AccessGet full text

Cover

More Information
Summary: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.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1041-4347
1558-2191
DOI:10.1109/69.317705