Testing for existence of a covering Boyce-Codd normal form

DOI10.1016/0020-0190(79)90082-6zbMath0411.68082OpenAlexW2050562762MaRDI 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 databaseBoyce-Codd normal formfunctional dependencies covering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (9)

On the desirability of \(\gamma\)-acyclic BCNF database schemes ⋮ Succinctness in dependency systems ⋮ Some results about normal forms for functional dependency in the relational datamodel ⋮ Autonomous sets for the hypergraph of all canonical covers ⋮ 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 ⋮ Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory ⋮ Lossless Decompositions in Complex-Valued Databases

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Testing for existence of a covering Boyce-Codd normal form