Design by exmple: An application of Armstrong relations
Journal of Computer and System Sciences
Design of relational database schemes by deleting attributes in the canonical decomposition
Journal of Computer and System Sciences
IEEE Transactions on Software Engineering
Elements of relational database theory
Handbook of theoretical computer science (vol. B)
Elements of information theory
Elements of information theory
An improved third normal form for relational databases
ACM Transactions on Database Systems (TODS)
A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems (TODS)
A new normal form for the design of relational database schemata
ACM Transactions on Database Systems (TODS)
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)
On the Structure of Armstrong Relations for Functional Dependencies
Journal of the ACM (JACM)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A Guided Tour of Relational Databases and Beyond
A Guided Tour of Relational Databases and Beyond
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
Sams Teach Yourself SQL in 21 Days
Sams Teach Yourself SQL in 21 Days
Justification for Inclusion Dependency Normal Form
IEEE Transactions on Knowledge and Data Engineering
The Theory of Probabilistic Databases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Reflections on Boyce-Codd Normal Form
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Achievements of Relational Database Schema Design Theory Revisited
Selected Papers from a Workshop on Semantics in Databases
Why is the snowflake schema a good data warehouse design?
Information Systems
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Database Systems: An Application Oriented Approach, Complete Version (2nd Edition)
Database Systems: An Application Oriented Approach, Complete Version (2nd Edition)
An information-theoretic approach to normal forms for relational and XML data
Journal of the ACM (JACM)
Beginning SQL Server 2005 for Developers: From Novice to Professional (Expert's Voice)
Beginning SQL Server 2005 for Developers: From Novice to Professional (Expert's Voice)
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
Dependency-preserving normalization of relational and XML data
Journal of Computer and System Sciences
A sophisticate's introduction to database normalization theory
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
What does Boyce-Codd normal form do?
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
A call to arms: revisiting database design
ACM SIGMOD Record
Design by example for SQL table definitions with functional dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
ACM Transactions on Database Systems (TODS)
Encoding databases satisfying a given set of dependencies
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
Normal forms that guide the process of database schema design have several key goals such as elimination of redundancies and preservation of integrity constraints, such as functional dependencies. It has long been known that complete elimination of redundancies and complete preservation of constraints cannot be achieved simultaneously. In this article, we use a recently introduced information-theoretic framework, and provide a quantitative analysis of the redundancy/integrity preservation trade-off, and give techniques for comparing different schema designs in terms of the amount of redundancy they carry. The main notion of the information-theoretic framework is that of an information content of each datum in an instance (which is a number in [0,1]): the closer to 1, the less redundancy it carries. We start by providing a combinatorial criterion that lets us calculate, for a relational schema with functional dependencies, the lowest information content in its instances. This indicates how good the schema design is in terms of allowing redundant information. We then study the normal form 3NF, which tolerates some redundancy to guarantee preservation of functional dependencies. The main result provides a formal justification for normal form 3NF by showing that this normal form pays the smallest possible price, in terms of redundancy, for achieving dependency preservation. We also give techniques for quantitative comparison of different normal forms based on the redundancy they tolerate.