Testing for existence of a covering Boyce-Codd normal form

DOI10.1016/0020-0190(79)90082-6MaRDI QIDQ1259438zbMATH OpenOpenAlexFDO

Authors Sylvia 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

Boyce-Codd normal formfunctional dependencies coveringrelational database

Mathematics Subject Classification ID

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

Cites work

• Decomposition of a Data Base and the Theory of Boolean Switching Functions
• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• scientific article; zbMATH DE number 3464830 (Why is no real title available?)
• scientific article; zbMATH DE number 3596225 (Why is no real title available?)
• Segment Synthesis in Logical Data Base Design
• The complexity of theorem-proving procedures

Cited in

(9)

• 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
• Autonomous sets for the hypergraph of all canonical covers
• Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory
• Lossless Decompositions in Complex-Valued Databases
• Succinctness in dependency systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1259438)