Issue No. 12 - December (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.260633
<p>Two relational join strategies, broadcast-based join and bucket-based join, have been recently proposed for the hypercube interconnection topology. The first strategy, however, incurs many unnecessary comparisons of pairs of tuples of the two relations. Although the second technique compares only tuples of the relevant buckets, it may suffer from potential load imbalance, which is most critical to the performance of a shared-nothing system. To address these issues, a join algorithm for hypercube computers which includes dynamic load balancing capabilities to minimize the effect of skewness in tuple distribution is proposed. Simulation results indicate that the scheme provides significant improvement over the bucket-based join strategy. In fact, the technique is consistently superior even when the skew condition is very mild.</p>
database management systems; hypercube networks; parallel architectures; relational databases; resource allocation; load balancing; shared-nothing hypercube; database computers; relational join strategies; broadcast-based join; bucket-based join; dynamic load balancing; skewness; tuple distribution; parallel join; relational database.
J.X.W. Su, K.A. Hua, "Dynamic Load Balancing in Very Large Shared-Nothing Hypercube Database Computers", IEEE Transactions on Computers, vol. 42, no. , pp. 1425-1439, December 1993, doi:10.1109/12.260633