FD集最优覆盖多项式时间求解算法的研究  

THE RESEARCH ON A POLYNOMIAL TIME ALGORITHM FOR SOLVING OPTIMAL COVER OF FD SET

作　　者：郝忠孝[1] 刘国华[1] 任家东 

机构地区：[1]齐齐哈尔轻工学院

出　　处：《计算机研究与发展》1996年第10期778-782,共5页Journal of Computer Research and Development

基　　金：黑龙江省自然科学基金

摘　　要：本文在详细分析了ＦＤ集的最小覆盖和最优覆盖的结构特性基础上，提出并讨论了一个最小覆盖成为最优覆盖的条件及一个最优覆盖的属性集构成的特点、相应的引理和定理。最后给出了一个求ＦＤ集最优覆盖的多项式时间算法。In this paper, the structure features of a minimum cover and an optimal cover of FD set are analyzed in detail. The condition under which a minimum cover becomes an optimal cover, the properties of composition of an optimal cover's attribute set,and relative lemmas and theorems are proposed and discussed. Finally,a polynomial time algorithm for solving an optimal cover of FD set is given.

关 键 词：FD集 关系模式 最小覆盖 最优覆盖 数据库 

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