历史关系模式的最大完全时间依赖集求法

The Algorithm Finding the Largest Complete Time Dependence Set

对基于TNF的历史关系模式TUg，提出了时间依赖、最大完全时间依赖集等重要概念，并给出了最大完全时间依赖集的求解算法及证明。为解决历史关系模式中存在的数据冗余、TNF异常等问题奠定了基础。

The paper first introduces some important concepts on the hi storical relational scheme based on TNF, including time dependence, th e largest complete time dependence set and so on, and then gives the a lgorithm and its proof for finding the largest complete time dependenc e set.This is the basis for resolving data redundancy and TNF abnormal in the historical relational scheme.