New methods and fast algorithms for database normalization
- 1 September 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 13 (3) , 339-365
- https://doi.org/10.1145/44498.44499
Abstract
A new method for computing minimal covers is presented using a new type of closure that allows significant reductions in the number of closures computed for normalizing relations. Benchmarks are reported comparing the new and the standard techniques.Keywords
This publication has 4 references indexed in Scilit:
- Normalization of relations and PROLOGCommunications of the ACM, 1986
- An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational DatabaseJournal of the ACM, 1982
- Computational problems related to the design of normal form relational schemasACM Transactions on Database Systems, 1979
- Synthesizing third normal form relations from functional dependenciesACM Transactions on Database Systems, 1976