Implementation of Parallel Collection Equi-Join

One of the collection joins types in Object Oriented Database (OODB) is collection equi-join. The main feature of collection joins is that they involve collection types. In this paper we present our experience in implementing collection equi-join algorithms by using Message Passing Interface (MPI). In particular, it layouts the fundamental techniques that are used in the implementation and that may be applicable to other collection joins. Two collection equi-joins discussed here are Double Sort- merge and Sort Hash Join. The implementation was done on a clustered environment and employed a data parallelism concept.

[1]  David Taniar,et al.  Parallel collection-equi join algorithms for object-oriented databases , 1998, Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156).

[2]  W. S. Luk,et al.  Parallel Join Algorithms on a Network of Workstations , 1988, Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems.

[3]  Alok N. Choudhary,et al.  High Performance OLAP and Data Mining on Parallel Computers , 1997, Data Mining and Knowledge Discovery.

[4]  David Jordan,et al.  The Object Database Standard: ODMG 2.0 , 1997 .

[5]  Wenny Rahayu,et al.  Parallel double sort-merge algorithm for object-oriented collection join queries , 1997, Proceedings High Performance Computing on the Information Superhighway. HPC Asia '97.