On the size of nonredundant FD-covers
From MaRDI portal
DOI10.1016/0020-0190(87)90110-4zbMATH Open0653.68110OpenAlexW2079445843WikidataQ59259784 ScholiaQ59259784MaRDI QIDQ1108065FDOQ1108065
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- A relational model of data for large shared data banks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing the minimum cover of functional dependencies
- Graph Algorithms for Functional Dependency Manipulation
- Minimum Covers in Relational Database Model
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Autonomous sets for the hypergraph of all canonical covers
- Title not available (Why is that?)
- Computing unique canonical covers for simple FDs via transitive reduction
- Title not available (Why is that?)
- Optimal covers in the relational database model
- Asymptotic properties of keys and functional dependencies in random databases
- Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory
- Computing the minimum cover of functional dependencies
- Direct product decompositions of lattices, closures and relation schemes
- Functional dependencies in relational databases: A lattice point of view
This page was built for publication: On the size of nonredundant FD-covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108065)
