This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Parallel Algorithm for Relational Database Normalization
October 1990 (vol. 1 no. 4)
pp. 415-423

The problem of database normalization in a parallel environment is examined. Generating relation schemes in third normal form is straightforward when given a set of functional dependencies that is a reduced cover. It is shown that a reduced cover for a set offunctional dependencies can be produced in parallel. The correctness of the algorithm is based on two important theorems. it is demonstrated that the companion third normal form algorithm can be easily translated into a parallel version. The performance of the two algorithms is compared to the performance of their serial counterparts. The standard serial algorithms for computing minimal covers and synthesizing third normal form relations are presented. The parallel algorithms and their rationale are discussed.

[1] Selim G. Akl,The Design and Analysis of Parallel Algorithms. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[2] Almasi, G.S., and Gottlieb, A.,Highly Parallel Computing, Benjamin/Cummings, Redwood City, Calif., 1989 [survey text: parallel architectures (Connection Machine, GF11, hypercubes, shared-memory multiprocessors, Ultra, RP3, Cedar), programming difficulties, and compiler methods].
[3] G. Ausielloet al., "Graph algorithms for functional dependency manipulation,"J. ACM, vol. 30. no. 4. pp. 752-766, Oct. 1983.
[4] C. Beeri and P. A. Bernstein, "Computational problems related to the design of normal form relational schemas,"ACM Trans. Data-base Syst., vol. 4, pp. 30-59, Mar. 1979.
[5] P. A. Bernstein, "Synthesizing third normal form relations from functional dependencies,"ACM Trans. Database Syst., vol. 1, no. 4, pp. 277-298, Dec. 1976.
[6] D. P. Bertsekas and J. N. Tsitsiklis,Parallel and Distributed Computations. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[7] D. Bitton, D. J. Dewitt, D. K. Hsiao, and J. Menon, "A taxonomy of parallel sorting,"Comput. Surveys, vol. 16, pp. 287-318, 1984.
[8] J. Biskup, U. Dayal, and P. Bernstein, "Synthesizing independent database schemes," inACM SIGMOD Conf. Proc., 1979, pp. 143-152.
[9] D. Bittonet al., "Parallel algorithms for the execution of relational database operation,"ACM Trans. Database Syst., vol. 8, no. 3, pp. 324-353, Sept. 1983.
[10] S. Ceri and G. Gottlob, "Normalization of the relations and Prolog,"Commun. ACM, vol. 29, no. 6, pp. 524-544, 1986.
[11] J. Diederich and J. Milton, "New methods and fast algorithms for database normalization,"ACM TODS, vol. 13, no. 3, pp. 339-365, Sept. 1988.
[12] D. Maier,The Theory of Relational Databases.Rockville, MD: Computer Science Press, 1983.
[13] E. Omiecinski and P. Scheuermann, "A parallel algorithm for record clustering,"ACM TODS, to be published.
[14] E. Omiecinski and E. Lin, "Hash-based and index-based join algorithms for cube and ring connected multicomputers,"IEEE Trans. Knowledge Data Eng., vol. 1, no. 3, pp. 329-343, Sept. 1989.
[15] E. Omiecinski and E. Tien, "A hash-based join algorithm for a cube-connected parallel computer,"Info. Proc. Lett., vol. 30, no. 5, pp. 269-275, Mar. 1989.
[16] M. Quinn,Designing Efficient Algorithms for Parallel Computers. New York: McGraw-Hill, 1987.
[17] M. J. Quinn and N. Deo, "Parallel graph algorithms,"ACM Comput. Surveys, vol. 16, pp. 319-348, Sept. 1984.
[18] J. D. Ullman,Database and Knowledge-base Systems. Rockville, MD: Computer Science Press, 1988.

Index Terms:
Index Termsparallel algorithm; relational database normalization; database normalization; relation schemes; functional dependencies; correctness; third normal form algorithm; serial algorithms; minimal covers; parallel algorithms; relational databases
Citation:
E.R. Omiecinski, "A Parallel Algorithm for Relational Database Normalization," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 4, pp. 415-423, Oct. 1990, doi:10.1109/71.80171
Usage of this product signifies your acceptance of the Terms of Use.