函数依赖集的有向图表示及在教学中的应用  

Directed Graph Representation of Functional Dependency Set and Its Application in Teaching

作　　者：陈卫刚[1] 王勋[1] 

机构地区：[1]浙江工商大学计算机与信息工程学院,浙江杭州310018

出　　处：《计算机时代》2010年第2期61-62,67,共3页Computer Era

摘　　要：以有向图表示函数依赖集,将求属性集的闭包转换成有向图的遍历问题,在此基础上,给出了求解候选码、最小覆盖等问题的解决方案。教学实践表明,该方法为相关内容的教学提供了图形化的手段,有助于学生利用数据结构知识来理解新的教学内容以及有关算法的编程和验证。Directed graph is used to represent functional dependency set, which makes computing the closure of attribute set become directed graph traversal problem. On this basis, the solution for computing candidate key and canonical cover is proposed. The teaching practice demonstrates that the above method provides graphical means for the related contents teaching, facilitates students understanding new teaching contents and implementing the related algorithms by using data structure knowledge.

关 键 词：函数依赖 属性集的闭包 候选码 最小覆盖 有向图 

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