Inferring multivalued dependencies from functional and join dependencies
- Cite this article as:
- Vardi, M.Y. Acta Informatica (1983) 19: 305. doi:10.1007/BF00290729
- 37 Downloads
We describe an algorithm to test whether a multivalued dependency is implied by a set of functional and join dependencies. The worst case running time of the algorithm is O(nm), where n is the length of the input and m is the number of the attributes in the universe. We also apply the algorithm to test implication of embedded multivalued dependencies, lossless join dependencies, acyclic join dependencies, first order hierarchical decompositions, and functional dependencies. The worst case running time of the algorithm for all these problems is still polynomial in the length of the input.