THE RESEARCH ON A POLYNOMIAL TIME ALGORITHM FOR SOLVING OPTIMAL COVER OF FD SET

In this paper, the structure features of a minimum cover and an optimal cover of FD set are analyzed in detail. The condition under which a minimum cover becomes an optimal cover, the properties of composition of an optimal cover’s attribute set,and relative lemmas and theorems are proposed and discussed. Finally,a polynomial time algorithm for solving an optimal cover of FD set is given.