Zhao, X. and Martin, N.J. and Johnson, Roger (2000) PPS: a parallel partition sort algorithm for multiprocessor database systems. In: Tjoa, A.M. and Wagner, R.R. and AI-Zobaidie, A. (eds.) 11th International Workshop on Database and Expert Systems Applications. IEEE Computer Society, pp. 635-646. ISBN 9780769506801.
Abstract
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.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 20 Apr 2021 19:25 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/43948 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
