Computing the minimum cover of functional dependencies

DOI10.1016/0020-0190(86)90063-3zbMath0587.68088OpenAlexW2072414537WikidataQ114685341 ScholiaQ114685341MaRDI QIDQ1072723

Robert C. Shock

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90063-3

zbMATH Keywords

algorithmdatabase

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (8)

Minimum implicational basis for \(\wedge\)-semidistributive lattices ⋮ On the size of nonredundant FD-covers ⋮ Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ Computations with finite closure systems and implications ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Algorithms for \(k\)-meet-semidistributive lattices ⋮ Translating between the representations of a ranked convex geometry

Cites Work

• On data dependency structures of relational databases
• Minimum Covers in Relational Database Model
• Unnamed Item

This page was built for publication: Computing the minimum cover of functional dependencies