摘要
本文为了讨论ＦＤ集的简化和研究最优覆盖的多项式求法，对标准ＦＤ集进行了定义和讨论。同时，还定义了与它相关的几个概念，讨论了标准ＦＤ集Ｆ成为最小覆盖的充要条件及其它问题。
In this paper, standard FDs set is defined and discussed for discussing simplification of FDs set and researching on the polynomial-time algorithm to find optimal cover of a FDs set. Meanwhile, several relational concepts are defined, and the full and necessary condition under which the standard FDs set becomes a minimum cover, and other problems are discussed.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1995年第8期20-24,共5页
Journal of Computer Research and Development
基金
国家自然科学基金
黑龙江省自然科学基金
关键词
标准FD集
FD集
数据库
最优覆盖
Standard-FD set, minimal cover, purity E_F (X), mixture E_F(X).
