HAO Zhongxiao. RESEARCH ON THE EXISTENCE OF A POLYNOMIAL-TIME ALGORITHM TO FIND THE CANDIDATE KEY WHOSE CARDINALITY IS MJ. Journal of Computer Research and Development, 1996, 33(10).
Citation:
HAO Zhongxiao. RESEARCH ON THE EXISTENCE OF A POLYNOMIAL-TIME ALGORITHM TO FIND THE CANDIDATE KEY WHOSE CARDINALITY IS MJ. Journal of Computer Research and Development, 1996, 33(10).
HAO Zhongxiao. RESEARCH ON THE EXISTENCE OF A POLYNOMIAL-TIME ALGORITHM TO FIND THE CANDIDATE KEY WHOSE CARDINALITY IS MJ. Journal of Computer Research and Development, 1996, 33(10).
Citation:
HAO Zhongxiao. RESEARCH ON THE EXISTENCE OF A POLYNOMIAL-TIME ALGORITHM TO FIND THE CANDIDATE KEY WHOSE CARDINALITY IS MJ. Journal of Computer Research and Development, 1996, 33(10).
RESEARCH ON THE EXISTENCE OF A POLYNOMIAL-TIME ALGORITHM TO FIND THE CANDIDATE KEY WHOSE CARDINALITY IS M
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.
DownLoad: