Year-end Sale % OFF 
Abstract
In this paper, a new hash join algorithm, the Dynamic Balancing Hash Join (DBJ), is 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 methods used include detecting the unbalanced output during the data partition process and overlapping the balancing process with the data partition process. The new algorithm only redistributes a small portion of the partitioned data and, thereby achieves a balanced output with little extra cost. Further, it balances the output dynamically and needs no knowledge of the input distribution. This is achieved without any need for a co-ordinating processor moreover. This algorithm has been fully implemented in a multiprocessor database system and a performance analysis is presented. The result shows that the new algorithm performs better than existing balancing hash join algorithms for a wide degree of skew.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
