Abstract
As processing power becomes cheaper and more available by using cluster of computers, the needs for parallel algorithms, which can harness these computing potentials, are increasing. Automatic database normalization is an application of parallel algorithms. Normalization is the most exercised technique for the analysis of relational databases. It aims at creating a set of relational tables with minimum data redundancy that preserve consistency and facilitate correct insertion, deletion, and modification. While existing sequential algorithms are usually much time consuming, especially the process of transforming relations into 3NF, in this paper, we have proposed parallel algorithms for automatic database normalization. The proposed algorithms have been examined with MPI and its implementation results on EDM showed that parallel approach reduces the time, efficiently. Exploiting p processors has reduced the time of Automatic Database Normalization to
in which c is the communication overhead between the processors, m is the number of simple keys, and n is the number of determinant keys