Minimal representation of directed hypergraphs
SIAM Journal on Computing
On the size of nonredundant FD-covers
Information Processing Letters
The design of relational databases
The design of relational databases
A new normal form for the design of relational database schemata
ACM Transactions on Database Systems (TODS)
Minimum Covers in Relational Database Model
Journal of the ACM (JACM)
A Guided Tour of Relational Databases and Beyond
A Guided Tour of Relational Databases and Beyond
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Computing unique canonical covers for simple FDs via transitive reduction
Information Processing Letters
Theory of Relational Databases
Theory of Relational Databases
Tractable database design through bounded treewidth
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Finding faithful boyce-codd normal form decompositions
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Autonomous sets for the hypergraph of all canonical covers
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functional dependencies, we obtain more efficient methods for solving several optimization problems in database design. These include finding one or all "optimal" covers w.r.t. different criteria, which can help to synthesize better decompositions, and to reduce the cost of constraint checking.