Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
Hash-based join algorithms for multiprocessor computers with shared memory
Proceedings of the sixteenth international conference on Very large databases
On optimal processor allocation to support pipelined hash joins
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Using shared virtual memory for parallel join processing
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
Parallel Hash-Based Join Algorithms for a Shared-Everything Environment
IEEE Transactions on Knowledge and Data Engineering
Distributed Load Balancing for Parallel Main Memory Hash Join
IEEE Transactions on Parallel and Distributed Systems
Multiprocessor hash-based join algorithms
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Performance analysis of a parallel sort merge join on cluster architectures
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
| Hi-index | 0.00 |
Hash joins are expensive and important operations in relational database systems. Developing parallel hash join algorithms is known as an efficient method to improve their performance. Since a parallel processing environment of a networked cluster of nodes is widely available for its advantages of low-cost, high speed and ease of use, we developed a parallel hash-based join algorithm in a networked cluster of multiprocessor nodes. The parallel hash-based join algorithm has two features. One is that it takes advantage of parallel and distributed environments in which shared-memory multiprocessor computers are nodes of a networked cluster. The other is that a distributed shared virtual space is integrated into the design of the parallel hash-based join algorithm so as to facilitate the algorithm and its implementation. In this paper, we present the ideas of design, describe the parallel hash-based join algorithm, show the performance evaluation of it, as well as give a dynamic changing message model for the presence of skew.