New methods and fast algorithms for database normalization

  • Authors:
  • Jim Diederich;Jack Milton

  • Affiliations:
  • Univ. of California, Davis;Univ. of California, Davis

  • Venue:
  • ACM Transactions on Database Systems (TODS)
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

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.