Synthesizing third normal form relations from functional dependencies
- 1 December 1976
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 1 (4), 277-298
- https://doi.org/10.1145/320493.320489
Abstract
It has been proposed that the description of a relational database can be formulated as a set of functional relationships among database attributes. These functional relationships can then be used to synthesize algorithmically a relational scheme. It is the purpose of this paper to present an effective procedure for performing such a synthesis. The schema that results from this procedure is proved to be in Codd's third normal form and to contain the fewest possible number of relations. Problems with earlier attempts to construct such a procedure are also discussed.Keywords
This publication has 5 references indexed in Scilit:
- Comment on “Decomposition of a Data Base and the Theory of Boolean Switching Functions” [Letter to the Editor]IBM Journal of Research and Development, 1977
- Comment on “Segment Synthesis in Logical Data Base Design” [Letter to the Editor]IBM Journal of Research and Development, 1976
- A unified approach to functional dependencies and relationsPublished by Association for Computing Machinery (ACM) ,1975
- Segment Synthesis in Logical Data Base DesignIBM Journal of Research and Development, 1975
- A relational model of data for large shared data banksCommunications of the ACM, 1970