Candidate Keys Solving Method Based on Boolean Matrix for Single Attribute Functional Dependency Sets

Candidate key is a very important concept in database design, the right or wrong of the appointed candidate keys determines the database optimization result to some extent. A solution algorithm solving candidate keys of single attribute functional dependency sets based on Boolean matrix is given in this paper. N class attribute, circuit and subgraph don´t have to be considered in the method, and it is very easy in program realization. The method can obtained all candidate keys in the appointed problem field. Meanwhile, the algorithm also can provide good foundation for solving candidate keys of complex attribute functional dependency sets.