Zhao, X. and Johnson, Roger and Martin, N.J. (1994) DBJ: a dynamic balancing hash join algorithm in multiprocessor database systems. In: Jarke, M. and Bubenko, J.A. and Jeffery, K.G. (eds.) Advances in Database Technology: 4th International Conference on Extending Database Technology. Lecture Notes in Computer Science 779. Springer, pp. 301-308. ISBN 9783540578185.
Abstract
The Dynamic Balancing Hash Join (DBJ), has been proposed to handle the problem of skewed data in the join operation in multiprocessor database systems. The objective of this new algorithm is to avoid the high cost of preprocessing inherent in existing algorithms. The new algorithm only redistributes a small portion of the partitioned data and, thereby achieves a balanced output with little extra cost. This is achieved dynamically, without knowledge of the input distribution, nor any co-ordinating processor. A performance analysis shows that the new algorithm performs better than existing balancing hash join algorithms 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: | 27 Apr 2021 20:32 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/43952 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
