Computing the minimum cover of functional dependencies (Q1072723): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q114685341, #quickstatements; #temporary_batch_1719407511203 |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / cites work | |||
Property / cites work: On data dependency structures of relational databases / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum Covers in Relational Database Model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3668890 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q114685341 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:13, 26 June 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