Reserch on Deciding Problem of Inside Conlict in Functional Dependency Set F

When discussing the decomposition of the database schema R〈W,F〉 without α cycle, it is necessary to decide whether the FD set F has inside conflicts It’s also necessary to decide whether the FD set F has inside conflicts when discussing the decomposition without β cycle or γ cycle Therefore, the concepts such as the 2 tuple set and closure of merge dependency set should first be given The multinominal algorithm to solve the 2 tuple set and its closure is also presented On this basis, the properties and relative conditions of the FD set F with inside conflicts is discussed The corresponding deciding theorem and algorithms with inside conflicts are presented and the algorithm is proven and analyzed The theorem and algorithm of the inside conflict and the proof and analysis of the algorithm are also given