关系数据库中MVD超图的讨论

Discussion on the Hypergraph of MVD in the Relational Database

摘要: 本文提出了ＭＶＤ超图的概念，给出了正向ＭＶＤ超图、逆向ＭＶＤ超图的定义。深入讨论了逆向ＭＶＤ超图、逆向准路（结点）、可分准路结点、不可分准路结点及最小不可分准路结点等。在此基础上，给出了求解最小不可分结点的闭包算法。

Abstract: The paper proposes the concept of the hypergraph of MVD and gives the definition ofthe forward and inverse hypergraph of MVD. The closure algorithm to find the inseparable node of theminimum quasi-path is given also.