Massively Parallel Relational Database Processing on the Connection Machine CM-2
Masaru Kitsuregawa, Kazuhiko Matsumoto · Database Systems for Advanced Applications · 1991
Several research effort has been devoted to increase the performance of the relational database systems. Various types of database machines were so far proposed. Among them, shared nothing parallel database system such as Teradata, GAMMA, TANDEM are actually implemented and detail performance evaluation is undergoing. On the other hand, recently massively parallel processor like the Connection Machine, attracts strong attention for the future super parallel system. Such parallel system is called “Data Parallel Computer” exploiting not procedure level parallelism but data level parallelism. One of the most promising application for such Data Parallel Machine be a relational database processing. However so far there has been no research to examine the effectiveness of massively parallel machine for RDB processing. In this paper we propose the two relation join algorithms for data parallel machine, that is, Data Parallel Sort Merge Join and Data Parallel Hash Join. These two algorithms are implemented on the Connection Machine CM-Z. Its performance is reported.