并行数据库上的并行CMD-Join算法  

Parallel CMD -Join Algorithms on Parallel Databases

作　　者：李建中[1] 都薇[1] 

机构地区：[1]黑龙江大学信息技术研究所

出　　处：《软件学报》1998年第4期256-262,共7页Journal of Software

基　　金：国家自然科学基金;国家863高科技项目基金;国家杰出青年基金;黑龙江省杰出青年基金

摘　　要：并行数据库在多处理机之间的分布方法（简称数据分布方法）对并行数据操作算法的性能影响很大．如果在设计并行数据操作算法时充分利用数据分布方法的特点，可以得到十分有效的并行算法．本文研究如何充分利用数据分布方法的特点，设计并行数据操作算法的问题，提出了基于ＣＭＤ多维数据分布方法的并行ＣＭＤ－Ｊｏｉｎ算法．理论分析和实验结果表明。Data declustering methods of parallel databases have significant effect on the performance of the parallel algorithms on the databases. If the characteristics of the declustering methods of the parallel database can be adequately exploited in designing parallel algorithms for implementing the database operations in parallel database systems, high performance parallel algorithms could be resulted. Unfortunately, the advantages of the underlying declustering methods of the parallel databases are rarely considered in existent parallel algorithms on the parallel databases. The focus of this paper is on how to utilize the advantages of the underlying declustering methods of the databases in designing parallel join algorithms. A set of parallel join algorithms based on the CMD declustering method are proposed. Theoretical and experimental results show that the proposed algorithms are more efficient than other parallel join algorithms.

关 键 词：并行数据库 并行JOIN算法 CMD-Join算法 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]