Elimination of intersection anomalies from database schemes
Journal of the ACM (JACM)
An integrated approach to logical design of relational database schemes
ACM Transactions on Database Systems (TODS)
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)
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)
On the Equivalence of Database Models
Journal of the ACM (JACM)
On the Desirability of Acyclic 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
Elimination of intersection anomalies from database schemes
Journal of the ACM (JACM)
An integrated approach to logical design of relational database schemes
ACM Transactions on Database Systems (TODS)
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Hi-index | 0.00 |
The desirability of acyclic database schemes is well argued in [8] and [13]. For schemas described by multivalued dependencies, acyclicity means that the dependencies do not split each other's left-hand sides and do not form intersection anomalies. In a recent work [4] it is argued that real-world database schemes always meet the former requirement, and in [5] it is shown that any given real-world scheme can be made to satisfy also the latter requirement, after being properly extended. However, the method of elimination of intersection anomalies proposed in [5] is intrinsically nondeterministic—an undesirable property for a design tool. In the present work it is shown that this nondeterminism does not, however, affect the final result of the design process. In addition, we present an efficient deterministic algorithm, which is equivalent to the nondeterministic process of [5]. Along the way a study of intersection anomalies, which is interesting in its own right, is performed.