Research On Membership Of Mixed Dependendency Set In Strong Partial Ordered Temporal Scheme

With the development of domestic and foreign scholars have in-depth studyand the rapid development of science and technology, temporal databasetechnology has become one of the active and hot research field nowadays.Temporal database not only contains historical information and also containscurrent information database. Temporal database can not only store object at anyinstant time and time period of the state, can also through analysis, comparisonand predict possible future state.The paper study the problem of the temporal candidate keywords in temporaldatabase and the judging problem of membership in strong partial order scheme。Developers design temporal database application system according to demand toimplement the standardization of database schema. Whether demand is to achievewhich level of paradigm, we need to solve the problem of "temporal mainattribute" and "temporal candidate keys". In order to study more effective and tofurther standardize the relationship between the attributes of temporal databaseand all kinds of dependence. This paper presents maximal relative block,temporal properties and other concepts and temporal attribute analysis ofdefinition and construction of rule table, respectively, using the maximumcorrelation method and temporal attributes analysis table method is given forsolving the base for the two temporal candidate key word of M set algorithm, andprove the correctness of the theory.The problem of considering and solving the membership is important in thealgorithm of mode decomposition effectively. Because of the partial orderamong temporal types in strong partial ordered temporal scheme, it is moredifficult to solve its membership problem. In this paper, the definitions of mixedset closure of partial TFDs and partial RTMVDs, mixed dependency base instrong partial ordered scheme, mixed closure in strong partial ordered scheme and mixed dependency base on given temporal type are given. The algorithms ofmixed dependency base in strong partial ordered temporal scheme and closure ofattribution sets are also given. On this basis, The algorithm of membershipproblem of mixed dependency set in strong partial ordered scheme is given. Thecorrectness and termination of algorithms are proved, and time complexity ofalgorithms are analyzed.This paper effectively solves the problem of mixed dependencydetermination in strong partial ordered temporal scheme and the problem ofsolving temporal candidate keywords set, for designing temporal database andsolving the standardization problem in strong partial ordered temporal schemeprovide theoretical basis.