求解关系模式中一个候选关键字的一种有效算法

通过分析关系模式的属性在函数依赖中所起的作用，发现在关系模式中的部分属性必定为主属性，而部分属性必定为非主属性，可以通过减少对属性的搜索次数，从而提高算法的效率，降低算法的时间复杂性。为此，本文提出一种切合实际的求解候选关键字的有效算法。

An Effective Algorithm for Calculating a Candidate Key of Relational Scheme

It is found out that some attributes must be prime attribute and some attributes must be nonprime attribute by analyzing the contribution that those attributes of relational scheme give,to function dependencies.It can advance the efficiency of algorithm and play down the complexity of time by cutting down the times of searching attributes.This paper puts forward an effective algorithm for adapting practice.