Yet another note on minimal covers

Authors:
Jyrki Nummenmaa;Peter Thanisch
Affiliations:
Departmnent of Computer Science, University of Tampere. P.O. Box 607, 33101 Tampere, Finland;Department of Computer Science, University of Edinburgh, King's Buildings, Mayfield Road, Edinburgh EH9, 3JZ, Scotland
Venue:
ACM SIGMOD Record
Year:
1990

Citing 4
Cited 1

Third normal form made easy

ACM SIGMOD Record
A note on minimal covers

ACM SIGMOD Record
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Theory of Relational Databases

Theory of Relational Databases

Minimal covers revisited: correct and efficient algorithms

ACM SIGMOD Record

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [Atk88] Atkins corrects a widely spread error in the algorithm for finding a minimal cover for a given set of functional dependencies. The erroneous form of the algorithm has been presented in [Sa186,StW83,Ul182,Yan88]. Unfortunately, though, there is an error also in the corrected algorithm.Atkins proposed the following algorithm for determining a minimal cover for a given set of functional dependencies F.