Study On Data Dependency In Strong Partial Order Temporal Scheme

Because of the rising demand of timing–dependent database application, caus-ing the design of temporal database became a very important problem. However, af-ter the introduction of a time dimension in the traditional database, the dates stored inthe information also subsequently becomes very large, which made the redundantinformation also increased. Because of this, a problem became very important: Howcan we effectively reduce the redundancy of functional dependency. Especially forthe temporal database which is based on strong partial order scheme environment.For a more in-depth study, this paper will study about the tense logical databasedesign which is based on strong partial order scheme environment, the aim is to pro-vide a theoretical basis for the strong partial order temporal database design, and tofind more effective theoretical tools and design methodologies.Theoretical study of the strong partial order temporal database is a partial orderunder the theory of temporal database research-based paper first describes the mean-ing and context of the temporal database, and the introduction of partial order tempo-ral mode related concepts, given the strong partial order under the data dependentderivation of rules: functional dependency derivation of rules and multi-valued de-pendency derivation of rules, correctness and validity of the relevant proof and infer-ence rules. And study standardized database system so as to improve the performanceof database systems in the strong partial order mode.And in the paper has been further exploreed on the basis of the study BC normalform in the existing partial order temporal scheme (ie Temporal BC Normal Form)decomposition problem, drawing on a totally ordered temporal simple candidate keys,and totally ordered temporal simple normal form in the total order study the theoreti-cal basis, for the study of partial order temporal simple candidate keys, and partialorder simple candidate keys is proposed and temporal type set of temporal function dependency of non-polymorphic type definitions which is based on partial ordertemporal is given, and related theorems are proved. On this basis, temporal schemethe main properties of partial order temporal third normal form (ie PO_T3NF) not beable to completely eliminate the relationship of the dependency on the transfer oftemporal keywords, for this puzzling problem further in-depth discussion the conceptput forward a simple specification of a very high degree of partial order temporalsimple normal form (ie PO_TSNF), and on the basis of this concept is given a simplenormal form of partial order temporal decision algorithm, the algorithm can be ter-mination, correctness and time complexity of the proof and disc ussion.