| FD集最优覆盖多项式时间求解算法的研究 |
| |
| 引用本文： | 郝忠孝,刘国华.FD集最优覆盖多项式时间求解算法的研究[J].计算机研究与发展,1996,33(10):778-782. |
| |
| 作者姓名： | 郝忠孝 刘国华 |
| |
| 作者单位： | 齐齐哈尔轻工学院 |
| |
| 摘 要： | 本文在详细分析了ＦＤ集的最小覆盖和最优覆盖的结构特性基础上，提出并讨论了一个最小覆盖成为最优覆盖的条件及一个最优覆盖珠属性集构成的特点，相应的引理和定理。最后给出一个求ＦＤ集最优覆盖的多项式时间算法。
|
| 关 键 词： | FD集 关系模式 最小覆盖 最优覆盖 数据库 |
THE RESEARCH ON A POLYNOMIAL TIME ALGORITHM FOR SOLVING OPTIMAL COVER OF FD SET |
| |
| Hao Zhongxiao,Liu Guobua, and Ren Jiadong.THE RESEARCH ON A POLYNOMIAL TIME ALGORITHM FOR SOLVING OPTIMAL COVER OF FD SET[J].Journal of Computer Research and Development,1996,33(10):778-782. |
| |
| Authors: | Hao Zhongxiao Liu Guobua and Ren Jiadong |
| |
| Abstract: | 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. |
| |
| Keywords: | FD set relational schema minimum cover optimal cover |
| 本文献已被 CNKI 维普 等数据库收录！ |
