关系模式中候选码求解定理的证明及算法改进  

Demonstration of The Theorem and Improvement of The Algorithm About Evaluating Candidate Keys of Relational Model

作　　者：廖飒[1] 

机构地区：[1]柳州职业技术学院计算机系,广西柳州545006

出　　处：《柳州职业技术学院学报》2005年第1期84-86,共3页Journal of Liuzhou Vocational & Technical College

摘　　要：本文对候选码求解定理进行了证明,并对其求解算法进行了改进,同时证明了改进算法与原算法之间的等价性问题,最后通过一个例子来说明改进算法在特定条件下可提高查找候选码的效率。In this paper, the theorem of evaluation of candidate keys is proved and an improved algorithm of evaluation is given. The equivalent of two algorithms is proved. At last, it is illustrated that the improved algorithm can increase the efficiency of evaluating all candidate keys in special condition.

关 键 词：求解定理 候选码 算法改进 证明 关系模式 改进算法 求解算法 特定条件 等价性 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论] O175.1[自动化与计算机技术—计算机科学与技术]