The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
Independent components of relations
ACM Transactions on Database Systems (TODS)
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Normal forms and relational database operators
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Equivalence of relational database schemes
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Constraint acquisition you can chase but you cannot find
APCCM '08 Proceedings of the fifth Asia-Pacific conference on Conceptual Modelling - Volume 79
An information-theoretic analysis of worst-case redundancy in database design
ACM Transactions on Database Systems (TODS)
Appropriate reasoning about data dependencies in fixed and undetermined universes
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Design by example for SQL table definitions with functional dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
The nested list normal form for functional and multivalued dependencies
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
On multivalued dependencies in fixed and undetermined universes
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Characterisations of multivalued dependency implication over undetermined universes
Journal of Computer and System Sciences
Conceptual Modelling and Its Theoretical Foundations
Appropriate inferences of data dependencies in relational databases
Annals of Mathematics and Artificial Intelligence
On Inferences of Full First-Order Hierarchical Decompositions
Fundamenta Informaticae - Logic, Language, Information and Computation
On the logical implication of multivalued dependencies with null values
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
| Hi-index | 0.00 |
Normalization research has concentrated on defining normal forms for database schemas and developing efficient algorithms for attaining these normal forms. It has never been proved that normal forms are good, i.e. that normal forms are beneficial to database users. This paper considers one of the earliest normal forms (Boyce Codd normal form [Cod2]) whose benefits are intuitively understood. We formalize these benefits and attempt to prove that the normal form attains them. Instead we prove the opposite: Boyce-Codd normal form fails to meet its goals except in trivial cases. This counterintuitive result is a consequence of the "universal relation assumption" upon which normalization theory rests. Normalization theory will remain an isolated theoretical area, divorced from database practice, until this assumption is circumvented.