CHANG Jianghua, HAO Zhongxiao, LIU Wenyuan, GAO Yan. AN ALGORITHM TO FIND OUT ALL CANDIDATEKEYS BASED ON THE CYCLE OF AN INVERSEFD HYPERGRAPHJ. Journal of Computer Research and Development, 1997, 34(3).
Citation:
CHANG Jianghua, HAO Zhongxiao, LIU Wenyuan, GAO Yan. AN ALGORITHM TO FIND OUT ALL CANDIDATEKEYS BASED ON THE CYCLE OF AN INVERSEFD HYPERGRAPHJ. Journal of Computer Research and Development, 1997, 34(3).
CHANG Jianghua, HAO Zhongxiao, LIU Wenyuan, GAO Yan. AN ALGORITHM TO FIND OUT ALL CANDIDATEKEYS BASED ON THE CYCLE OF AN INVERSEFD HYPERGRAPHJ. Journal of Computer Research and Development, 1997, 34(3).
Citation:
CHANG Jianghua, HAO Zhongxiao, LIU Wenyuan, GAO Yan. AN ALGORITHM TO FIND OUT ALL CANDIDATEKEYS BASED ON THE CYCLE OF AN INVERSEFD HYPERGRAPHJ. Journal of Computer Research and Development, 1997, 34(3).
AN ALGORITHM TO FIND OUT ALL CANDIDATEKEYS BASED ON THE CYCLE OF AN INVERSEFD HYPERGRAPH
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.
DownLoad: