Autonomous Sets - A Method for Hypergraph Decomposition with Applications in Database Theory

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.

• Type: Conference
• Year: 2008
• Where: FOIKS
• Authors: Henning Köhler
• Keywords: Canonical Covers, Certain Regularities, FOIKS 2008, Information Management, Smaller Hypergraphs