【摘要】 文中提出了Ｈａｓｈ 划分的改进方法——ＩＨ 划分． ＩＨ划分为结点扩充时数据的重新划分提供了方便．在论述ＩＨ 划分的基础上，给出了基于该数据划分方法的并行Ｊｏｉｎ 算法．利用已有的数据分布，文中提出的并行Ｊｏｉｎ 算法提高了算法的效率．最后，从理论上对以上并行算法的计算复杂性进行了分析．更多还原

【Abstract】 IH partition, an improvement of Hash partition, is presented in this paper. IH partition has many advantages in dealing with data re\|partition among processing nodes. Parallel join algorithms based on IH partition are discussed. The performance of these algorithms is improved by utilizing existing data partition. Finally, the theoretical analysis of the computing complexity of these algorithms is presented.更多还原