| The discovery of multivalued dependencies from relations is viewed as a search in a hypothesis space defined in accordance with the generalization relationship among the multivalued dependencies. Two algorithms for the discovery of multivalued dependencies from relations are implemented. The top-down algorithm enumerates the hypotheses from the most general to more specific hypotheses which are checked on the input relation. The bottom-up algorithm first computes the set of invalid multivalued dependencies. Starting with the most general dependencies, the bottom-up algorithm iteratively refines the set of dependencies to conform with each particular invalid dependency. | | |