A parallel sort-balance mutual range-join algorithm on hypercube computers

作     者：Wong, R Topor, R Shen, H 

作者机构：Griffith Univ Sch Comp & Informat Technol Nathan Qld 4111 Australia 

出 版 物：《MICROPROCESSORS AND MICROSYSTEMS》 (Microprocessors Microsyst)

年 卷 期：1998年第22卷第3-4期

页      面：209-215页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：relational database query evaluation range-join hypercube parallel algorithm 

摘      要：This paper presents an efficient parallel algorithm for computing the mutual range-join of N sets of numbers on shared-nothing hypercube computers. The algorithm iteratively joins each set to the mutual range-join of the preceding sets. Each join is performed on all processors of the hypercube in parallel. The algorithm uses a global sorting method to distribute the elements of the first set evenly across all processors in increasing order, a new data balancing technique to distribute the elements of subsequent sets to match the intermediate set at each processor and to compensate for join skew, and a new efficient local range-join procedure. We analyse the performance of this algorithm and demonstrate that it improves on the previous result for this problem when the join selectivity factor is small and the restriction of SIMD operation is lifted. The method can also be applied to similar problems such as band-join and equi-join. (C) 1998 Elsevier Science B.V.