An improved third normal form for relational databases
- 1 June 1981
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 6 (2) , 329-346
- https://doi.org/10.1145/319566.319583
Abstract
In this paper, we show that some Codd third normal form relations may contain “superfluous” attributes because the definitions of transitive dependency and prime attribute are inadequate when applied to sets of relations. To correct this, an improved third normal form is defined and an algorithm is given to construct a set of relations from a given set of functional dependencies in such a way that the superfluous attributes are guaranteed to be removed. This new normal form is compared with other existing definitions of third normal form, and the deletion normalization method proposed is shown to subsume the decomposition method of normalization.Keywords
This publication has 13 references indexed in Scilit:
- The theory of joins in relational databasesACM Transactions on Database Systems, 1979
- Computational problems related to the design of normal form relational schemasACM Transactions on Database Systems, 1979
- On the number of candidate keysInformation Processing Letters, 1978
- Candidate keys for relationsJournal of Computer and System Sciences, 1978
- Normalization and hierarchical dependencies in the relational data modelACM Transactions on Database Systems, 1978
- Functional Dependencies in a Relational Database and Propositional LogicIBM Journal of Research and Development, 1977
- Multivalued dependencies and a new normal form for relational databasesACM Transactions on Database Systems, 1977
- Synthesizing third normal form relations from functional dependenciesACM Transactions on Database Systems, 1976
- Decomposition of a Data Base and the Theory of Boolean Switching FunctionsIBM Journal of Research and Development, 1973
- A relational model of data for large shared data banksCommunications of the ACM, 1970