Parallel Hash-Based Join Algorithms for a Shared-Everything Environment

Authors:
T. P. Martin;P. -Å. Larson;V. Deshpande
Affiliations:
-;-;-
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
1994

Citing 15
Cited 5

Join processing in database systems with large main memories

ACM Transactions on Database Systems (TODS)
Design and evaluation of parallel pipelined join algorithms

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
The Join Algorithms on a Shared-Memory Multiprocessor Database Machine

IEEE Transactions on Software Engineering
The data model and query language of LauRel

Data Engineering
A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Encapsulation of parallelism in the Volcano query processing system

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Join and Semijoin Algorithms for a Multiprocessor Database Machine

ACM Transactions on Database Systems (TODS)
Parallelism in relational data base systems: architectural issues and design approaches

DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Parallel algorithms for the execution of relational database operations

ACM Transactions on Database Systems (TODS)
Approximating block accesses in database organizations

Communications of the ACM
Implementation techniques for main memory database systems

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers

IEEE Transactions on Knowledge and Data Engineering
Hashing Methods and Relational Algebra Operations

VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Hash-Based Join Algorithms for Multiprocessor Computers

VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Benchmarking Database Systems A Systematic Approach

VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases

&mgr;Database: parallelism in a memory-mapped environment (research summary)

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
A parallel hash-based join algorithm for a networked cluster of multiprocessor nodes

COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
CORDS: status and directions

CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
Revisiting pipelined parallelism in multi-join query processing

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Parallel implementation of external sort and join operations on a multi-core network-optimized system on a chip

ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.