Performance Evaluation of Hash Join Algorithms Supporting Dynamic Load Balancing for a Database Sharing System


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 12, pp. 3456-3468, Dec. 1999
10.3745/KIPSTE.1999.6.12.3456,   PDF Download:

Abstract

Most of previous parallel join algorithm assume a database partition system(DPS), where each database partition is owned by a single processing node. While the DPS is novel in the sense that it can interconnect a large number of nodes and support a geographically distributed environment, it may suffer from poor facility for load balancing and system availability compared to the database sharing system(DSS).In this paper, we propose a dynamic load balancing strategy by exploiting the characteristics of the DSS, and then extend the conventional hash join algorithms to the DSS by using the dynamic load balancing strategy. With simulation studies under a wide variety of system to the DSS and database workloads, we analyze the effects of the dynamic load balancing strategy and differences in the performances of hash join algorithms in the DSS.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
A. K. Moon and H. R. Cho, "Performance Evaluation of Hash Join Algorithms Supporting Dynamic Load Balancing for a Database Sharing System," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 12, pp. 3456-3468, 1999. DOI: 10.3745/KIPSTE.1999.6.12.3456.

[ACM Style]
Ae Kyung Moon and Haeng Rae Cho. 1999. Performance Evaluation of Hash Join Algorithms Supporting Dynamic Load Balancing for a Database Sharing System. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 12, (1999), 3456-3468. DOI: 10.3745/KIPSTE.1999.6.12.3456.