Autonomous sets for the hypergraph of all canonical covers

DOI10.1007/s10472-012-9276-zzbMath1243.68170OpenAlexW2088954436MaRDI QIDQ429444

Henning Koehler

Publication date: 19 June 2012

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-012-9276-z

zbMATH Keywords

databasehypergraphtransversalcoverfunctional dependency

Mathematics Subject Classification ID

Database theory (68P15) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing unique canonical covers for simple FDs via transitive reduction
• On the size of nonredundant FD-covers
• Some simplified NP-complete graph problems
• Candidate keys for relations
• Testing for existence of a covering Boyce-Codd normal form
• Minimum Covers in Relational Database Model
• A new normal form for the design of relational database schemata
• An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
• Algorithm Theory - SWAT 2004
• Finding Faithful Boyce-Codd Normal Form Decompositions