Abstract: On the basis of 3,the features of the attributes composing a candidate key are discussed in detail and deeply,the concepts such as relative relation,maximal relative block,etc.are presented,and the relative theorems are also discussed. Finally,a polynomial-time algorithm to find the candidate key whose cardinality is M is given.