论文信息 - New methods and fast algorithms for database normalization

New methods and fast algorithms for database normalization

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.

Jim Diederich | Jack Milton | J. Diederich | J. Milton

[1] Ramez Elmasri,et al. The Structural Model for Database Design , 1979, ER.

[2] David Maier,et al. The Theory of Relational Databases , 1983 .

[3] Zvi Galil,et al. An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database , 1982, JACM.

[4] Philip A. Bernstein,et al. Computational problems related to the design of normal form relational schemas , 1979, TODS.

[5] J. D. Uiiman,et al. Principles of Database Systems , 2004, PODS 2004.

[6] Georg Gottlob,et al. Normalization of relations and PROLOG , 1986, CACM.

[7] Philip A. Bernstein,et al. Synthesizing third normal form relations from functional dependencies , 1976, TODS.