An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
On the design of relational database schemata
ACM Transactions on Database Systems (TODS)
An improved third normal form for relational databases
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
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)
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
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 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
Analysis and design of relational schemata for database systems.
Analysis and design of relational schemata for database systems.
An improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme
IEEE Transactions on Software Engineering
Deduction Graphs: An Algorithm and Applications
IEEE Transactions on Software Engineering
Models for the Combined Logical and Physical Design of Databases
IEEE Transactions on Computers
Independence-reducible database schemes
Journal of the ACM (JACM)
Simple conditions for guaranteeing higher normal forms in relational databases
ACM Transactions on Database Systems (TODS)
Physical database design: a decision support model
ACM SIGMIS Database
Conjunctive query equivalence of keyed relational schemas (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relative information capacity of simple relational database schemata
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
IEEE Transactions on Software Engineering
On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML design for relational storage
Proceedings of the 16th international conference on World Wide Web
An information-theoretic analysis of worst-case redundancy in database design
ACM Transactions on Database Systems (TODS)
Autonomous sets: a method for hypergraph decomposition with applications in database theory
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Lossless decompositions in complex-valued databases
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Autonomous sets for the hypergraph of all canonical covers
Annals of Mathematics and Artificial Intelligence
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
Hi-index | 0.00 |
This paper addresses the problem of database schema design in the framework of the relational data model and functional dependencies. It suggests that both Third Normal Form (3NF) and Boyce-Codd Normal Form (BCNF) supply an inadequate basis for relational schema design. The main problem with 3NF is that it is too forgiving and does not enforce the separation principle as strictly as it should. On the other hand, BCNF is incompatible with the principle of representation and prone to computational complexity. Thus a new normal form, which lies between these two and captures the salient qualities of both is proposed. The new normal form is stricter than 3NF, but it is still compatible with the representation principle. First a simpler definition of 3NF is derived, and the analogy of this new definition to the definition of BCNF is noted. This analogy is used to derive the new normal form. Finally, it is proved that Bernstein's algorithm for schema design synthesizes schemata that are already in the new normal form.