Normalization and hierarchical dependencies in the relational data model
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
First order logic formalization for functional, multivalued and mutual dependencies
SIGMOD '78 Proceedings of the 1978 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
Testing implications of data dependencies
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A complete axiomatization for a large class of dependencies in relational datatbases
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Horn clauses and database dependencies (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Analysis and design of relational schemata for database systems.
Analysis and design of relational schemata for database systems.
Sort sets in the relational model
Journal of the ACM (JACM)
The design of ¬ 1NF relational databases into nested normal form
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Sort sets in the relational model
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
The membership problem for probabilistic and data dependencies
Technologies for constructing intelligent systems
The logic of representing dependencies by directed graphs
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
The logic of representing dependencies by directed graphs
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
On axiomatization of probabilistic conditional independencies
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
On Inferences of Full First-Order Hierarchical Decompositions
Fundamenta Informaticae - Logic, Language, Information and Computation
| Hi-index | 0.00 |
Much work has been done recently on finding a complete set of dependency rules for Embedded Multivalued Dependencies (EMVDs), the generalization of the Multivalued Dependencies developed by Fagin and Zaniolo. We show that no finite such set of rules can exist by explicitly constructing a class containing, for all n, irreducible n-ary EMVD inference rules. These n-ary rules may be understood clearly when described in terms of the more "expressive" Transitive Dependencies (TDs) of Paredaens. However, we show in addition that no finite set of rules can exist for TDs either.