Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
On the menbership problem for functional and multivalued dependencies in relational databases
ACM Transactions on Database Systems (TODS)
A Complete Axiomatization of Full Join Dependencies
Journal of the ACM (JACM)
Properties of acyclic database schemes
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Equivalence of relational database schemes
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
An extension of conflict-free multivalued dependency sets
ACM Transactions on Database Systems (TODS)
A new normal form for nested relations
ACM Transactions on Database Systems (TODS)
The design of ¬ 1NF relational databases into nested normal form
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Models for the Combined Logical and Physical Design of Databases
IEEE Transactions on Computers
Reduced MVDs and minimal covers
ACM Transactions on Database Systems (TODS)
Database design for incomplete relations
ACM Transactions on Database Systems (TODS)
A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Dependency characterizations for acyclic database schemes
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Improving database schemes by adding attributes
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Controlling FD and MVD Inferences in Multilevel Relational Database Systems
IEEE Transactions on Knowledge and Data Engineering
A Comparative Study of Various Nested Normal Forms
IEEE Transactions on Knowledge and Data Engineering
Comprehensive Approach to the Design of Relational Database Schemes
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Database Decomposition into Fourth Normal Form
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Constructing the Bayesian network structure from dependencies implied in multiple relational schemas
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
According to database theory, a database designer can specify any set of data dependencies, no matter how complex, to constrain a database scheme. This paper investigates how much complexity is actually needed in real-world situations. It is shown that every "natural" set of mvd's must belong to a class of mvd's called conflict-free. Conflict-free sets of mvd's have the desirable property that they allow a unique 4NF dependency preserving database scheme; moreover, non conflict-free sets have no such normalization. If a set of mvd's is not conflict-free, then the dependencies are inadequately specified; there are semantic concepts that are unrepresented in the scheme. These concepts are isolated, and it is shown that adding these concepts amounts to making the set of mvd's conflict-free.