作者: Iztok Savnik , Peter A. Flach
关键词: Dependency (UML) 、 Multivalued dependency 、 Acyclic dependencies principle 、 Join dependency 、 Theoretical computer science 、 Set (abstract data type) 、 Computer science 、 Relation (database) 、 Dependency theory (database theory) 、 Functional dependency
摘要: Discovery of multivalued dependencies from database relations is viewed as a search in hypothesis space defined according to the generalisation relationship among dependencies. Two algorithms for discovery are presented. The top-down algorithm enumerates hypotheses most general more specific which checked on input relation. bottom-up first computes invalid Starting with dependencies, iteratively refines set conform each particular dependency. implementation analysed and some empirical results