Optimal covers in the relational database model

DOI10.1007/S00236-015-0247-9zbMATH Open1347.68112OpenAlexW1908227512MaRDI QIDQ303689FDOQ303689

Zhijun Xiao, Xiaoning Peng

Publication date: 22 August 2016

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-015-0247-9

zbMATH Keywords

minimum coverfunctional dependencymini-coverminimum Boolean expressionoptimal cover

Mathematics Subject Classification ID

Database theory (68P15) Logical aspects of Boolean algebras (03G05)

Cites Work

• Title not available (Why is that?)
• A relational model of data for large shared data banks
• Candidate keys for relations
• On the relationship of minimum and optimum covers for a set of functional dependencies
• Graph Algorithms for Functional Dependency Manipulation
• Minimal Representation of Directed Hypergraphs
• Minimum Covers in Relational Database Model
• Functional Dependencies in a Relational Database and Propositional Logic
• Decomposition of a Data Base and the Theory of Boolean Switching Functions

Recommendations

• Computing the minimum cover of functional dependencies 👍 👎
• On the size of nonredundant FD-covers 👍 👎
• The synthesis approach for relational database design: An expanded perspective 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Optimal covers in the relational database model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q303689)