Computing the minimum cover of functional dependencies (Q1072723): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(86)90063-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072414537 / rank | |||
Normal rank | |||
Revision as of 00:32, 20 March 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
