By Topic

PPS-a parallel partition sort algorithm for multiprocessor database systems

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
$33 $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

3 Author(s)
X. Zhao ; Dept. of Comput. Sci., London Univ., UK ; N. J. Martin ; R. G. Johnson

A new algorithm, parallel partition sort (PPS), is proposed which is an improved range partition sort algorithm to handle the problem of workload imbalance, especially partition imbalance and heterogeneous imbalance, in a shared-nothing multiprocessor database environment. The new algorithm partitions the key range into a number of range intervals, then a fast internal sorting method is applied on each range interval combined with a dynamic mechanism to handle different interval sizes. A dynamic mathematical model approach is used to balance the workload among processing nodes by estimating data distribution during the sorting process. Experimental results demonstrate that the new algorithm performs better than existing parallel range partition sorting algorithms in a shared-nothing database environment for a wide degree of skew

Published in:

Database and Expert Systems Applications, 2000. Proceedings. 11th International Workshop on

Date of Conference: