Abstract
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs, in a "direct product"-like fashion. 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. As a central step we investigate how the hypergraph of all canonical covers can be computed efficiently. Our results suggest that decomposed representations of this hypergraph are usually small and can be obtained rather quickly, even if the number of canonical covers is huge.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
