Computing the minimum cover of functional dependencies (Q1072723)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the minimum cover of functional dependencies |
scientific article; zbMATH DE number 3943073
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the minimum cover of functional dependencies |
scientific article; zbMATH DE number 3943073 |
Statements
Computing the minimum cover of functional dependencies (English)
0 references
1986
0 references
Let FD: \(X\to Y\) denote a functional dependency and let F denote a set of FDs. An FD: \(X\to Y\) is said to be closed if Y is the closure of X under F. A cover is closed if each FD is closed. The main theoretical result states that a closed, nonredundant cover is a minimum cover. A simple algorithm is presented to compute a minimum cover for F.
0 references
database
0 references
algorithm
0 references
