The Community for Technology Leaders
Green Image
<p><it>Abstract</it>—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.</p>
Relational join, parallel processing, load balancing, database systems, NUMA architecture.

S. Pramanik and W. R. Tout, "Distributed Load Balancing for Parallel Main Memory Hash Join," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 841-849, 1995.
86 ms
(Ver 3.3 (11022016))