Research On Multi-Valued Dependency Of Partial Ordered Temporal Scheme In Temporal Database

With the development of the modern society, people's lives are in high-speed operation and we are contacting with various kinds of complicated information. Then how to deal with and store these huge and complex data becomes one of the difficulties for the scientific researchers, therefore, the requirements for database storage are much higher. We judge the database in many different ways, but the most important one is that it could eliminate the redundant data in the process of storage and it could insert, delete and update the information at the same time. So the temporal data we talk is the same.In our real life, the time exists everywhere and it is omnipotent, connecting closely with all things in the world. In the traditional database, we just paid attention to the property of the data which has been stored, ignoring the history of the stored data. In this way, we could not find out the intrinsical nature of the object through the stored information, which is its drawback; however, the temporal database introduces the information of time, allowing people could both check out its history of the data and predict its future, which is its excellent feature. Nevertheless, like the traditional database it also has a lot of problems with its standardization, and the data dependency is the most important one in the process of its standardization, which are the emphasis and difficult points.In the temporal database, we will introduce the concept of the time. In the single mode, the data dependency has no better way of describing the nature of the stored data, so we will introduce the partial ordered mode. In the better mode, we can improve the performance of the system, and the present research direction is to analyze the data dependency through the dependency in the traditional database, along with the partial ordered granularity.This article will make an intensive study of the multivalued dependency of the semi-order temporal. In the beginning, we will introduce the functional dependency of the partial ordered temporal and define its related concepts. Then we will put forward with the operation for the greatest lower bound in order to avoid producing new temporal types in the process of decomposition of schema, which could influence complexity of the arithmetic. This thesis pays more attention to the functional dependency of the partial ordered temporal and gives more related concepts. In addition, it provides several limited inference rules and proves some related theories. At last, this article introduces the problem of the nonloss decomposition in the non-restrictive partial ordered mode and provides some examples, which lays the first stone for standardizing the temporal database.