摘要
在关系模式中,属性集X关于函数依赖集F的闭包XF＋是求解众多问题的基础。该文中,依据函数依赖集将关系模式转化为有向图的形式,并使用Wareshall算法来求解关于函数依赖的传递闭包矩阵,使XF＋的求解形式化,操作更加简单易行。
In relational schema,XF＋ is the closure of attribute set X about functional dependency set F.And it is the basic of many prob lems.In the paper,it turns the relational schema into a directed graph,and the functional dependency transitional closure matrix is easy to resolve using the Wareshall＇s algorithm.The functional dependency transitional closure matrix is useful to resolve the XF＋.
作者
刘丽
井艳芳
LIU Li,JING Yan-fang（1.Department of Information and Engineering,Shandong Jiaotong University,Ji＇nan 250023,China;2.The School of Computer Sci ence,Liaocheng University,Liaocheng 252000,China）
出处
《电脑知识与技术》
2012年第4期2352-2354,共3页
Computer Knowledge and Technology
关键词
函数依赖
XF+
Wareshall算法
传递闭包
Function Dependency
XF＋
Wareshall＇s Algorithm
Function Dependency Transitional Closure Matrix
