并行数据库系统PAROⅡ连接算法

Join algorithms for parallel database system PAROⅡ

提出了并行数据库系统的哈希轮转 (Hash Round Robin)数据划分方法以及基于该划分方法的并行记录分布Bn 树 ,给出了基于该树的并行连接算法 ,分析了该算法的效率 .这种连接算法充分利用了数据的已有分布及Bn 树的特性 ,还利用了哈希轮转划分的特性 ,提高了并行连接的效率 。

Hash Round Robin partition, an improvement of Hash and Round Robin partition of PAROⅡ, is proposed at improved parallel record distributed B tree structure, parallel record distributed B n tree of PAROⅡ, based on Hash Round Robin partition is presented. And parallel join algorithm based on parallel record distributed B n tree is proposed and the efficiency of this algorithm is analyzed in detail. This algorithm making full use of data distribution, property of B n tree and Hash Round Robin partition enhances the efficiency of parallel join. This algorithm is used in parallel database PAROⅡ implemented by our study.