Computing the minimum cover of functional dependencies
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(18)- On the size of nonredundant FD-covers
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- Computing premises of a minimal cover of functional dependencies is intractable
- Translating between the representations of a ranked convex geometry
- Optimal covers in the relational database model
- scientific article; zbMATH DE number 3943859 (Why is no real title available?)
- scientific article; zbMATH DE number 4039355 (Why is no real title available?)
- scientific article; zbMATH DE number 4057065 (Why is no real title available?)
- scientific article; zbMATH DE number 4110179 (Why is no real title available?)
- scientific article; zbMATH DE number 883940 (Why is no real title available?)
- Closure via functional dependence simplification
- scientific article; zbMATH DE number 1453046 (Why is no real title available?)
- The joy of implications, aka pure Horn formulas: mainly a survey
- Algorithms for k-meet-semidistributive lattices
- Computations with finite closure systems and implications
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Computing unique canonical covers for simple FDs via transitive reduction
- Minimum implicational basis for \(\wedge\)-semidistributive lattices
This page was built for publication: Computing the minimum cover of functional dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072723)
