作者: 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