The research of the algorithm of the minimum cover for XML
Wenqiang Liu · Journal of Qiqihar University · 2005
In this paper, we present two algorithms for finding a minimum cover for FDs propagated from XML keys.The first algorithm takes exponential time. The second algorithm takes polynomial time in the size of input. This algorithm effectively finds a minimum cover for FDs propagated from XML keys.