| 关系模式一种基于超图的全部候选关键字求法 |
| |
| 引用本文： | 郝忠孝,郭景峰.关系模式一种基于超图的全部候选关键字求法[J].计算机学报,1992,15(4):264-270. |
| |
| 作者姓名： | 郝忠孝 郭景峰 |
| |
| 作者单位： | 东北重型机械学院，东北重型机械学院 富拉尔基 161042，富拉尔基 161042 |
| |
| 摘 要： | 本文详细讨论了基于超图的关系模式的有关候选关键字的某些理论,给出了相应的定理.圆满地解决了关系模式全部候选关键字的求解问题,具体地给出了以递归形式的求全部候选关键字的新算法.
|
| 关 键 词： | 候选关键字 超图 关系模式 数据库 |
A HYPERGRAPH BASED METHOD FOR FINDING OUT ALL CANDIDATE KEYS OF RELATION SCHEMA |
| |
| Hao Zhongxiao and Guo Jingfeng.A HYPERGRAPH BASED METHOD FOR FINDING OUT ALL CANDIDATE KEYS OF RELATION SCHEMA[J].Chinese Journal of Computers,1992,15(4):264-270. |
| |
| Authors: | Hao Zhongxiao and Guo Jingfeng |
| |
| Abstract: | In this paper, some theories on candidate keys of relation schema basedon hypergraph are discussed in detail. The problem to find out all candidate keys of relation schema is solved satisfactorily. And a new recursive algorithm of finding out all candidate keys is given. |
| |
| Keywords: | Candidate keys hypergraph relation schema quasi-cycles |
| 本文献已被 CNKI 维普 等数据库收录！ |
