On the size of nonredundant FD-covers

DOI10.1016/0020-0190(87)90110-4zbMath0653.68110OpenAlexW2079445843WikidataQ59259784 ScholiaQ59259784MaRDI QIDQ1108065

Georg Gottlob

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90110-4

zbMATH Keywords

database theoryfunctional dependenciesminimum coveroptimal covernonredundant covers

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (5)

Asymptotic properties of keys and functional dependencies in random databases ⋮ Autonomous sets for the hypergraph of all canonical covers ⋮ Functional dependencies in relational databases: A lattice point of view ⋮ Direct product decompositions of lattices, closures and relation schemes ⋮ Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory

Cites Work

• Computing the minimum cover of functional dependencies
• Graph Algorithms for Functional Dependency Manipulation
• Minimum Covers in Relational Database Model
• A relational model of data for large shared data banks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the size of nonredundant FD-covers