A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
Maximal objects and the semantics of universal relation databases
ACM Transactions on Database Systems (TODS)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Principles of Database Systems
Principles of Database Systems
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Properties of acyclic database schemes
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The use of one acyclic join dependency and a set of functional dependencies appears powerful enough to represent data semantics in a relational database. There are several ways to characterize the acyclic join dependency, each providing its own desirable properties. In this paper we provide a sufficient condition for a join dependency to be acyclic and an algorithm that can aid a database designer. If the join dependency the designer wishes to use is cyclic, then, based on the results of the algorithm, we give two distinct methods that the designer can use to solve this problem. The methods can be implemented syntactically; however, the choice of a solution in a given case depends on the intended semantics. We also show how a combination of the two methods might be best in some cases.