The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—This paper presents a parallel distributive join algorithm for cube-connected multiprocessors. The performance analysis shows that the proposed algorithm has an almost linear speedup over the sequential distributive join algorithm [<ref rid="bibl012712" type="bib">12</ref>] as the number of processors increases, and its performance is comparable to that of the parallel hybrid-hash join algorithm [<ref rid="bibl012713" type="bib">13</ref>]. A big advantage of the proposed algorithm over hash-based join algorithms is that it does not have the bucket overflow problem caused by nonuniform hashing of the smaller operand relation. Moreover, the proposed algorithm can easily support the nonequijoin operation, which is very hard to implement by using hash-based join algorithms.</p>
Distributive join, parallel processing, cube-connected processors, performance analysis, hashing join.

S. M. Chung and J. Yang, "A Parallel Distributive Join Algorithm for Cube-Connected Multiprocessors," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 127-137, 1996.
87 ms
(Ver 3.3 (11022016))