Testing for existence of a covering Boyce-Codd normal form

DOI10.1016/0020-0190(79)90082-6zbMath0411.68082MaRDI QIDQ1259438

Sylvia L. Osborn

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90082-6

zbMATH Keywords

relational database; Boyce-Codd normal form; functional dependencies covering

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68P05: Data structures

68P20: Information storage and retrieval of data

Related Items

Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory, Lossless Decompositions in Complex-Valued Databases, Autonomous sets for the hypergraph of all canonical covers, Succinctness in dependency systems, On the desirability of \(\gamma\)-acyclic BCNF database schemes, On covering Boyce-Codd normal forms, The complexity of recognizing 3NF relation schemes, Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in \(O(N^ 2)\) time, Some results about normal forms for functional dependency in the relational datamodel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Segment Synthesis in Logical Data Base Design
• The complexity of theorem-proving procedures
• Decomposition of a Data Base and the Theory of Boolean Switching Functions