Implementation and proof for normalization design of object-oriented data schemes

Describes a normalization design for complex object schemes and its proof. The purpose of normalizing complex object schemes is not only to group objects into related relationships, but also to choose a structure for the information system which is a good representation of the semantic relationships among objects that already exist in the real world. Firstly, we define the object dependency (OD) based on the data dependencies among objects, and we present the properties of the OD. Then we define the object normal form, the normal object scheme tree and the normal object scheme forest, and show the properties of the object normal form. We show that the normal object scheme forest is the most desirable structure for complex object schemes. Then we present the algorithm MIMI for deriving a normal object scheme forest. Finally, we present and prove the properties of a normal object scheme forest produced by the MIMI algorithm under a set of conflict-free ODs