Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in \(O(N^ 2)\) time

DOI10.1016/0020-0190(92)90018-QzbMath0772.68029WikidataQ114685334 ScholiaQ114685334MaRDI QIDQ1199942

Mila E. Majster-Cederbaum

Publication date: 17 January 1993

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

zbMATH Keywords

functional dependenciesrelational model

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing for existence of a covering Boyce-Codd normal form
• Graph Algorithms for Functional Dependency Manipulation
• On the menbership problem for functional and multivalued dependencies in relational databases
• Functional Dependencies in a Relational Database and Propositional Logic
• A relational model of data for large shared data banks
• Decomposition of a Data Base and the Theory of Boolean Switching Functions