Optimal covers in the relational database model
From MaRDI portal
Publication:303689
DOI10.1007/S00236-015-0247-9zbMATH Open1347.68112OpenAlexW1908227512MaRDI QIDQ303689FDOQ303689
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
Recommendations
- scientific article
- Computing the minimum cover of functional dependencies
- The synthesis approach for relational database design: An expanded perspective
- On the size of nonredundant FD-covers
- scientific article
- scientific article; zbMATH DE number 1453046
- scientific article
- scientific article; zbMATH DE number 1755716
- Publication:4733444
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
Cited In (8)
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)