摘要
本文提出了一种新的动态Hash连接方法──DHJ（dynamichash join），以解决并行数据库连接操作中的数据偏斜现象.为避免目前某些算法提出的预处理中隐含的高额费用，该方法在划分阶段通过增添附加桶的方法来平衡输出，然后依据计算确认哪些附加桶被映射到处理器上并确定处理器分配，在最后阶段完成连接.本文最后给出了该算法的性能分析.
In this paper, a new hash join algorithm-DHJ(the dynamic hash join) is proposed to resolve the problem of skewed data in the join operation in parallel database.The objective of the algorithm is to avoid the high cost of processing inherent in some early work. Additional buckets are used in the algorithm to balance output during the data partition. Then they are mapped to different processors before the completion of the join operation. The performance analysis of the algorithm is provided in this paper.
出处
《软件学报》
EI
CSCD
北大核心
1997年第8期610-614,共5页
Journal of Software
基金
国家自然科学基金
