并行数据库系统PAROII连接算法

Join Algorithms of Parallel Database System Paroll

介绍PAROII采用的哈希轮转 (Hash -Round -Robin)数据划分方法以及基于该划分方法的并行RDBn树 ,着重、详细地讨论了基于该树的并行连接算法 ,该算法充分利用了数据的已有分布、Bn 树的特性、叶结合点有序连接、哈希轮转划分的特性 ,这些特性减少了系统的额外消耗 。

This paper deals with Hash-Round-Robin partition introduced in PAROLL and RDB n which is based on Hash and Round-Robin partition.Then,we present a detailed description of parallel Join algorithms which make full use data distribution,the characteristics of B n tree,the ordered join in the leaf node and the Hash-Round-Robin partition characteristics.These characteristics reduce the extra system consumption and improve the efficiency of parallel join algorithms.