一种求左边是单属性关系模式候选码的方法

The Method of Single Attribute Relational Schema Candidate Code for the Left Side

在数据库的设计过程中,分析关系模式的候选码是认识关系模式的第一步,也是进一步进行关系模式分解的基础。图论是数学的一个分支,本文从关系候选码的定义出发,应用图论矩阵的性质,提出了一种在左边是单属性的函数依赖集中寻找关系模式候选码的方法。

In the database design process, analysis of the candidate of a relation scheme is the first step to understanding it, is also the basis of the further decomposition of relation scheme. Graph theory is a branch of mathematics, starting firom the definition of the candidate key, using the characters of the matrix of graph theory, this paper proposed a method to looking for the relation scheme＇s candidate key of a leit single attribute functional dependency set.