Algorithms for inferring functional dependencies from relations

作者: Heikki Mannila , Kari-Jouko Räihä

DOI: 10.1016/0169-023X(94)90023-X

关键词:

摘要: Abstract The dependency inference problem is to find a cover of the set functional dependencies that hold in given relation. has applications relational database design, query optimization, and artificial intelligence. exponential number attributes. We develop two algorithms with better best case behavior than simple one. One algorithm reduces computing transversal hypergraph. other based on repeatedly sorting relation respect

参考文章(30)
Thomas G. Dietterich, Hussein Almuallim, Learning with many irrelevant features national conference on artificial intelligence. pp. 547- 552 ,(1991)
William Ward Armstrong, Dependency Structures of Data Base Relationships. ifip congress. pp. 580- 583 ,(1974)
János Demetrovics, Gy. Gyepesi, On the functional dependency and some generalizations of it. Acta Cybernetica. ,vol. 5, pp. 295- 305 ,(1981)
Alexander Borgida, Keith E. Williamson, Accommodating exceptions in databases, and refining the schema by learning from them very large data bases. pp. 72- 81 ,(1985)
V D Thi, The minimal keys and antikeys Acta Cybernetica. ,vol. 7, pp. 361- 371 ,(1986)
J. Demetrovics, V. D. Thi, Some results about functional dependencies Acta Cybernetica. ,vol. 8, pp. 273- 278 ,(1988)
Heikki Mannila, Kari-Jouko Räihä, The Design of Relational Databases ,(1992)
J. G. Carbonell, T. M. Mitchell, R. S. Michalski, Machine Learning: An Artificial Intelligence Approach Springer Publishing Company, Incorporated. ,(2013)
Thomas Eiter, Georg Gottlob, Identifying the Minimal Transversals of a Hypergraph and Related Problems SIAM Journal on Computing. ,vol. 24, pp. 1278- 1304 ,(1995) , 10.1137/S0097539793250299