Parallel Distributive Join Algorithm on the Intel Paragon

Authors:
Soon M. Chung;Arindam Chatterjee
Affiliations:
Dept. of Computer Science and Engineering, Wright State University, Dayton, Ohio 45435, USA;Microsoft Corporation, Redmond, WA 98052, USA
Venue:
The Journal of Supercomputing
Year:
1999

Citing 7
Cited 0

A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Performance of a disk array protype

SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Distributive join: a new algorithm for joining relations

ACM Transactions on Database Systems (TODS)
The design and evaluation of RAID 5 and parity striping disk array architectures

Journal of Parallel and Distributed Computing - Special issue on parallel I/O systems
RAID: high-performance, reliable secondary storage

ACM Computing Surveys (CSUR)
A Parallel Distributive Join Algorithm for Cube-Connected Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we analyze the performance of the parallel Distributive Join algorithm that we proposed in Chung and Yang 1995. We implemented the algorithm on an Intel Paragon machine and analyzed the effect of the number of processors and the join selectivity on the performance of the algorithm. We also compared the performance of the Distributive Join (DJ) algorithm with that of the Hybrid-Hash(HH) join algorithm. Our results show that the DJ performs comparably with the HH over the entire range of number of processors used and different join selectivities. A big advantage of the parallel DJ algorithm over the HH join algorithm is that it can easily support non-equijoin operations. The results can also be used to estimate the performance of file I/O intensive applications to be implemented on the Intel Paragon machine.