By Topic

Dynamic load balancing in very large shared-nothing hypercube database computers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hua, K.A. ; Dept. of Comput. Sci., Central Florida Univ., Orlando, FL, USA ; Su, J.X.W.

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

Published in:

Computers, IEEE Transactions on  (Volume:42 ,  Issue: 12 )