利用函数依赖图寻找关系模式的候选码  

Seeking for Relation Scheme Candidate Key by Using Functional Depending Graph

作　　者：覃遵跃[1] 徐洪智[1] 冯峻松[1] 蔡国民[1] 

机构地区：[1]吉首大学数学与计算机科学系,湖南张家界427000

出　　处：《安庆师范学院学报（自然科学版）》2004年第1期3-5,共3页Journal of Anqing Teachers College(Natural Science Edition)

摘　　要：寻找关系模式的候选码是数据库设计理论中的重要问题。本文利用图论的有关知识,先构造一个关系模式的函数依赖图,然后提出函数依赖与候选码的关系,并采用逆邻接表作为它的存贮结构,利用图的广度优先搜索技术,给出了具体寻找关系模式候选码的算法。Seeking for candidate key of relation scheme is an important question in designing database theory. According to the graph theory, the paper firstly constructs a functional depending graph of relation scheme, then puts forth the relationship between the function depending and the candidate key. At last it provides the concrete method of seeking for algorithm for relation scheme candidate key by using both reverse adjacency list as its storing structure and BFS technology of graph.

关 键 词：关系模式 候选码 函数依赖 函数依赖图 

分 类 号：TP311.11[自动化与计算机技术—计算机软件与理论]