Autonomous sets for the hypergraph of all canonical covers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 108405 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 1294230 (Why is no real title available?)
- A new normal form for the design of relational database schemata
- Algorithm Theory - SWAT 2004
- An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
- Candidate keys for relations
- Computing unique canonical covers for simple FDs via transitive reduction
- Finding Faithful Boyce-Codd Normal Form Decompositions
- Minimum Covers in Relational Database Model
- On the size of nonredundant FD-covers
- Some simplified NP-complete graph problems
- Testing for existence of a covering Boyce-Codd normal form
Cited in
(3)
This page was built for publication: Autonomous sets for the hypergraph of all canonical covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429444)