New methods and fast algorithms for database normalization

Jim Diederich, Jack Milton · ACM Transactions on Database Systems · 1988

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.

Read the paper · More papers on PaperTik