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视图中定义的有效备选键，从而很容易地创建这些键。
In this paper, the theories and methods to simplify the relation schema with keeping equal candidate keys by successive elimination technologies are given.
本文研究了通过消元法将一个关系模式化成与之具有相同候选关键字的一组简单关系模式的理论和方法。
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.
圆满地解决了关系模式全部候选关键字的求解问题，具体地给出了以递归形式的求全部候选关键字的新算法。
The candidate contains this passage: "The XML Signature ... does not normatively specify how keys are associated with persons or institutions, nor the meaning of the data being referenced and signed.
候选方案包括这样一段︰「XML签名……没有规范地指定如何将金钥与个人或社会团体相关联，也没有指定正在引用并签名的资料的含意。
The SIFT keys derived from an image are used in a nearest-neighbour approach to indexing to identify candidate object models.
从图象获得的过滤钥匙用于对辨认候选人对象模型的标注的一种近邻居方法。
The SIFT keys derived from an image are used in a nearest-neighbour approach to indexing to identify candidate object models.
从图象获得的过滤钥匙用于对辨认候选人对象模型的标注的一种近邻居方法。
应用推荐