A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
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)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
On the menbership problem for functional and multivalued dependencies in 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)
On the Equivalence of Database Models
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
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
Principles of Database Systems
Principles of Database Systems
Connections in acyclic hypergraphs: extended abstract
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The tree property is fundamental for query processing
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
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
On the recognition and design of acyclic databases
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Dependency characterizations for acyclic database schemes
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
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
| Hi-index | 0.00 |
The desirability of acyclic database scheme is well argued in [L,BFMY]. When a scheme is described by multivalued dependencies, acyclicity means that the dependencies do not split each other's left-hand side and do not form intersection anomalies. We show that if the second condition fails to hold, the scheme can be amended so that it holds. The basic step is to add one attribute and some dependencies to resolve one intersection anomaly. This step generates an extension of the given scheme in which the anomaly does not exists. We also analyze the repetitive use of the basic step and prove that the transformation so defined removes all intersection anomalies. Finally, we characterize a class of attributes that can be removed from the final scheme, leaving it acyclic.