Implementation of Parallel Collection Equi-Join Using MPI

Authors:
Nung Kion Lee;David Taniar;J. Wenny Rahayu;Mafruz Zaman Ashrafi
Affiliations:
-;-;-;-
Venue:
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Year:
2002

Citing 6
Cited 0

Parallel join algorithms on a network of workstations

DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Parallel programming with MPI

Parallel programming with MPI
A taxonomy for object-oriented queries

Current trends in data management
High Performance OLAP and Data Mining on Parallel Computers

Data Mining and Knowledge Discovery
Parallel Double Sort-Merge Algorithm for Object-Oriented Collection Join Queries

HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Parallel Collection-Equi Join Algorithms for Object-Oriented Databases

IDEAS '98 Proceedings of the 1998 International Symposium on Database Engineering & Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.