Performance Evaluation of the Hybrid Join

Ho CHANG  Hwang Kyu CHOI  Myunghwan KIM  

IEICE TRANSACTIONS (1976-1990)   Vol.E73   No.8   pp.1351-1360
Publication Date: 1990/08/25
Online ISSN: 
Print ISSN: 0000-0000
Type of Manuscript: PAPER
Category: Algorithm, Data Structure and Computational Complexity

Full Text: PDF>>
Buy this Article

In this paper, we evaluate the performance of a new join algorithm, called hybrid join, which improves both the sort-merge and the hash-partitioned join algorithms. The hybrid join consists of completely sorting only the smaller relation and partitioning the other one into ranged buckets according to the order statistics of the sorted relation. The final joining is performed on the sorted relation and the ranged buckets. By analytical comparisons, we show that the hybrid join always outperforms the sort-merge join and guarantees better performance than that of the hash-partitioned join in practical situations. The analyses of the performances for the various methods are validated by simulation experiments.