Abstract: In this paper, the feature of a node corresponding to the attribute composing a candidate key are found by studying the class of the cycle of an inverse FD hypergraph deeply, and then a new palynomial time algorithm to find out all candidate keys is given.