确定F_(min)的一个算法

An Algorithm for Getting F_(min)

构造了一个求解最小函数依赖集Fmin的计算机算法.该算法将求解Fmin的逻辑推理过程包装在一个C++函数之中,通过运行与此函数相配套的程序,可以快速、准确地获得与所给函数依赖集F等价的Fmin.从而使求解Fmin的过程方便、快捷.

This paper constructs an algorithm for getting F_(min). It is a fundamental work to find out a F_(min) of a given functional dependency set while normalizing a relational pattern. The principle to find out F_(min) is presented in textbooks. We have to implement the principle manually, which will take much more time to get F_(min) and more mistakes would happen when the functional dependency set is multiplicity. The paper presents the algorithm into a C++ function named Min. By running the correlative program, we can get F_(min) quickly and correctly.