Performance Evaluation of the Hybrid Join
Summary :
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.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E73-E No.8 pp.1351-1360
- Publication Date
- 1990/08/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Algorithm, Data Structure and Computational Complexity
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ho CHANG, Hwang Kyu CHOI, Myunghwan KIM, "Performance Evaluation of the Hybrid Join" in IEICE TRANSACTIONS on transactions,
vol. E73-E, no. 8, pp. 1351-1360, August 1990, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_8_1351/_p
Copy
@ARTICLE{e73-e_8_1351,
author={Ho CHANG, Hwang Kyu CHOI, Myunghwan KIM, },
journal={IEICE TRANSACTIONS on transactions},
title={Performance Evaluation of the Hybrid Join},
year={1990},
volume={E73-E},
number={8},
pages={1351-1360},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Performance Evaluation of the Hybrid Join
T2 - IEICE TRANSACTIONS on transactions
SP - 1351
EP - 1360
AU - Ho CHANG
AU - Hwang Kyu CHOI
AU - Myunghwan KIM
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 8
JA - IEICE TRANSACTIONS on transactions
Y1 - August 1990
AB - 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.
ER -
English
