A parallel algorithm for relational database normalization

Author

Omiecinski, Edward R.

Author_Institution

Sch. of Inf. & Comput. Sci., Georgia Inst. of Technol., Atlanta, GA, USA

Volume

1

Issue

4

fYear

1990

fDate

10/1/1990 12:00:00 AM

Firstpage

415

Lastpage

423

Abstract

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 of functional 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

Keywords

parallel algorithms; relational databases; correctness; database normalization; functional dependencies; minimal covers; parallel algorithm; relation schemes; relational database normalization; serial algorithms; third normal form algorithm; Computer science; Concurrent computing; Helium; Parallel algorithms; Parallel processing; Pathology; Performance analysis; Query processing; Relational databases; Standards development;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.80171

Filename

80171