Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Normalization and hierarchical dependencies in the relational data model
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)
An Efficient Algorithm for Finding an Irredundant Set Cover
Journal of the ACM (JACM)
On Axiomatizing Multivalued Dependencies in Relational Databases
Journal of the ACM (JACM)
A unified approach to functional dependencies and relations
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
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 Equivalence between Dependencies in Nested Databases and a Fragment of Propositional Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
An Equivalence between Dependencies in Nested Databases and a Fragment of Propositional Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
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
| Hi-index | 0.00 |
Recently Delobel and Parker have shown that Multivalued dependencies (MVDS) may be represented as Boolean switching functions, in much the same way as Functional dependencies (FDs) can be represented as Boolean implications. This permits all FD and MVD inferences to be made as logical (Boolean) inferences, a significant plus because the FD/MVD inference axioms are fairly complex. This paper reviews some of the basic implications of this result and outlines new applications in FD/MVD membership testing, generation of dependency closure, cover, and keys, and testing for lossless and independent decompositions.