Recommendations
Cites work
- scientific article; zbMATH DE number 3890770 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 42986 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 3464830 (Why is no real title available?)
- A relational model of data for large shared data banks
- Computing the minimum cover of functional dependencies
- Graph Algorithms for Functional Dependency Manipulation
- Minimum Covers in Relational Database Model
Cited in
(10)- Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory
- Computing unique canonical covers for simple FDs via transitive reduction
- Direct product decompositions of lattices, closures and relation schemes
- Autonomous sets for the hypergraph of all canonical covers
- Functional dependencies in relational databases: A lattice point of view
- scientific article; zbMATH DE number 4016958 (Why is no real title available?)
- Optimal covers in the relational database model
- Asymptotic properties of keys and functional dependencies in random databases
- scientific article; zbMATH DE number 4110179 (Why is no real title available?)
- Computing the minimum cover of functional dependencies
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)