摘要
本文深入分析了最小基数候选关键字在关系模式中的结构特征,提出了化简独立复合环、独立简单环、化简双部属性函数依赖图等概念。在此基础上 。
Following analysing the structure of the candidate keys of minimum cardinality in relation schema,in this paper,the concepts,such as reduced independent composite cycle,reduced double_part attribute founction dependency graph are proposed,and then,a polynomial_time algorithm about finding out all candidate keys of minimum cardinality relative to a relation schema is given.
出处
《齐齐哈尔大学学报（自然科学版）》
2001年第4期33-37,共5页
Journal of Qiqihar University(Natural Science Edition)
关键词
化简独立复合环
最小基数候选关键字
多项式算法
关系模式
reduced independent composite cycle
the candidate key of minimum cardinality
polynomial-time algorithm
relation schema
