| 基于逆向FD超图环的全部候选关键字求法 |
| |
| 引用本文： | 唱江华,郝忠孝.基于逆向FD超图环的全部候选关键字求法[J].计算机研究与发展,1997,34(3):223-228. |
| |
| 作者姓名： | 唱江华 郝忠孝 |
| |
| 作者单位： | 齐齐哈尔轻工学院 |
| |
| 摘 要： | 本文通过对逆向ＦＤ超图的环的分类的深入研究，找到了组成候选关键字的属性对应的结点的特征，进而给出了求解全部候关键字的多项式时间的新算法。
|
| 关 键 词： | 逆向FD超图环 关键字 候选关键字 数据库 |
AN ALGORITHM TO FIND OUT ALL CANDIDATEKEYS BASED ON THE CYCLE OF AN INVERSEFD HYPERGRAPH |
| |
| CHANG Jiang,Hua,HAO Zhong,Xiao,LIU Wen,Yuan,GAO Yan.AN ALGORITHM TO FIND OUT ALL CANDIDATEKEYS BASED ON THE CYCLE OF AN INVERSEFD HYPERGRAPH[J].Journal of Computer Research and Development,1997,34(3):223-228. |
| |
| Authors: | CHANG Jiang Hua HAO Zhong Xiao LIU Wen Yuan GAO Yan |
| |
| 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. |
| |
| Keywords: | inverse FD hypergraph cycle candidate key algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
