Computing the minimum cover of functional dependencies (Q1072723): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:09, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing the minimum cover of functional dependencies |
scientific article |
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