One can compute a key only. The other could find out all candidate keys.
算法一可计算出一个候选码,算法二可计算出全部候选码。
Two algorithms to compute the candidate keys of a relational database schema are given in this paper.
本文介绍了求解一个关系模式的候选码的两种算法。
The tool makes creating these keys easy by automatically providing a lookup on the valid candidate keys defined in the columns view.
该工具通过自动提供查找 Columns 视图中定义的有效备选键,从而很容易地创建这些键。
应用推荐