Boyce–Codd normal form and object normal forms
References (9)
- et al.
Design of relational database schemes by deleting attributes in the canonical decomposition
J. Comput. System Sci.
(1987) - et al.
What does Boyce–Codd normal form do?
Proc. 6th Internat. Conf. on Very Large Data Bases
(1980) - et al.
A characterization of constant-time maintainability for BCNF database schemes
Proc. ACM–SIGMOD Internat. Conf. on Management of Data
(1988) A simple guide to five normal forms in relational database theory
Comm. ACM
(1983)
There are more references available in the full text version of this article.
Cited by (18)
Relational database schema design for uncertain data
2019, Information SystemsCitation Excerpt :Armstrong axiomatized FDs [5], and linear-time algorithms to decide their implication problem are known [6,18]. These results provide the foundation for relational schema design, including 3NF [7,10,12], BCNF [8,15] and their semantic justification as to dependency-preservation and minimization of data redundancy [4,36,55]. Deciding if a schema is in 3NF is NP-complete, while the same problem for BCNF is in P-time but deciding if a projection of a schema is in BCNF is coNP-complete [6].
Reducing inference control to access control for normalized database schemas
2008, Information Processing LettersOrdered functional dependencies in relational databases
1999, Information SystemsInsertion anomalies and the justification for 4NF in relational databases
1994, Information SciencesFunctional dependencies in relational databases: A lattice point of view
1992, Discrete Applied MathematicsObject Normal Form, Fourth Normal Form and Their Application to Database Security
2022, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1989 Published by Elsevier B.V.