DISCUSSION OF SEVERAL RELATIONAL PROBLEMS OF STANDARD FDs SET

In this paper, standard FDs set is defined and discussed for discussing simplification of FDs set and researching on the polynomial-time algorithm to find optimal cover of a FDs set. Meanwhile, several relational concepts are defined, and the full and necessary condition under which the standard FDs set becomes a minimum cover, and other problems are discussed.