The second algorithm takes polynomial time in the size of input.This algorithm effectively finds a minimum cover for FDs propagated from XML keys.

• 第二个算法需要花费输入集合的多项式时间倍,此算法有效地计算来自XML关键字的函数依赖最小覆盖的算法。