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. © 1988, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Diederich, J., & Milton, J. (1988). New Methods and Fast Algorithms for Database Normalization. ACM Transactions on Database Systems (TODS), 13(3), 339–365. https://doi.org/10.1145/44498.44499
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free