Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
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
An Axiomatic Approach to Defining Approximation Measures for Functional Dependencies
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
Improving Query Evaluation with Approximate Functional Dependency Based Decompositions
BNCOD 19 Proceedings of the 19th British National Conference on Databases: Advances in Databases
| Hi-index | 0.00 |
Making use of arguments from information theory it is shown that a boolean function can represent multivalued dependencies. A method is described by which a hypergraph can be constructed to represent dependencies in a relation. A new normal form called generalized Boyce-Codd normal form is defined. An explicit formula is derived for representing dependencies that would remain in a projection of a relation. A definition of join is given which makes the derivation of many theoretical results easy. Another definition given is that of information in a relation. The information gets conserved whenever lossless decompositions are involved. It is shown that the use of null elements is important in handling data.