| 并行数据库的改进Hash划分方法及并行Join算法 |
| |
| 引用本文： | 陆丽娜,孟虹,魏恒义,杨麦顺. 并行数据库的改进Hash划分方法及并行Join算法[J]. 计算机研究与发展, 2000, 37(2): 159-163 |
| |
| 作者姓名： | 陆丽娜 孟虹 魏恒义 杨麦顺 |
| |
| 作者单位： | 西安交通大学计算机科学与技术系,西安,710049 |
| |
| 摘 要： | 文中提出了Ｈａｓｈ划分的改进方法－－ＩＨ划分，ＩＨ划分为结点扩充时数据的重新划分提供了方便，在论述ＩＨ划分的基础上，给出了基于该数据划人垢并行Ｊｏｉｎ算法，利用已有数据分布，文中提出的并行Ｊｏｉｎ算法提高算法的效率。最后，从理论上对以上并行算法的计算复杂性进行了分析。
|
| 关 键 词： | 数据 并行数据库 数据划分 Join算法 |
IMPROVED HASH PARTITION FOR PARALLEL DBMS AND PARALLEL JOIN ALGORITHMS |
| |
| LU Li-Na,MENG Hong,WEI Heng-Yi,YANG Mai-Shun. IMPROVED HASH PARTITION FOR PARALLEL DBMS AND PARALLEL JOIN ALGORITHMS[J]. Journal of Computer Research and Development, 2000, 37(2): 159-163 |
| |
| Authors: | LU Li-Na MENG Hong WEI Heng-Yi YANG Mai-Shun |
| |
| Affiliation: | LU Li-Na, MENG Hong, WEI Heng-Yi,YANG Mai-Shun;(Department of Computer Science and Technology, Xi'an Jiaotong University, Xi'an 710049) |
| |
| 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. |
| |
| Keywords: | database parallel database data partition |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
