Matlab在求候选关键字的替换算法中的应用  

Application of Matlab in Replacement Algorithm for Finding All Candidate Keys

作　　者：吴荣海[1] 范晓梅[1] 

机构地区：[1]大理学院数学与计算机学院,云南大理671003

出　　处：《大理学院学报（综合版）》2013年第10期9-13,共5页Journal of Dali University

基　　金：云南省教育厅科学研究基金资助项目(2011Y255)

摘　　要：在关系模式分解和规范化过程中,候选关键字的确定具有重要意义。针对该问题利用Matlab对求给定关系模式R(U,F)全部候选关键字的替换算法进行了实现,测试结果表明,给出的Matlab函数代码简洁、运行速度较快,运行结果正确、直观且易于理解。The candidate keys play an important role in the decomposition process and normalization process for relational schema. In the paper, a replacing algorithm for finding all candidate keys of relational schema R （U, F） has been implemented in Matlab. Finally, it was verified by the example that was complied and simulated in Matlab. The result of simulation is easier to understand and show the speediness, efficiency, correctness of the M-functions.

关 键 词：MATLAB 关系模式 属性闭包 候选关键字 

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