The Join Algorithms on a Shared-Memory Multiprocessor Database Machine
IEEE Transactions on Software Engineering
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Proceedings of the sixteenth international conference on Very large databases
Parallel database systems: the future of high performance database systems
Communications of the ACM
Approximating block accesses in database organizations
Communications of the ACM
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers
IEEE Transactions on Knowledge and Data Engineering
Prototyping Bubba, A Highly Parallel Database System
IEEE Transactions on Knowledge and Data Engineering
Effectiveness of Parallel Joins
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the Eighth International Conference on Data Engineering
VLDB '88 Proceedings of the 14th 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
Distributed Linear Hashing and Parallel Projection in Main Memory Databases
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Practical Skew Handling in Parallel Joins
VLDB '92 Proceedings of the 18th 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
An Adaptive Hash Join Algorithm on a Network of Workstations
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
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
Proposal of an analytical solution for the load imbalance problem in parallel systems
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
| Hi-index | 0.00 |
Parallel joins have been widely studied during the past decade and a number of efficient algorithms were presented. While it is known that the performance of these algorithms may suffer greatly in the presence of skewed input data, the work on load balancing schemes for parallel join has been limited. The main contribution of this paper is the development and analysis of a new distributed data structure and an effective load balancing scheme for parallel main memory hash join on NUMA architecture. Multiprocessors based on this architecture are scalable in both size of main memory and number of processors, and provide very high memory bandwidth. The load balancing scheme is based on random probing to avoid the hot spot problems caused by probing sequentially. We have modeled this load balancing scheme both analytically and experimentally. The experiments were run on a BBN TC2000 multiprocessor system.