Dynamic Database by Inconsistency and Morphogenetic Computing

Since Peter Chen published the article Entity---Relationship Modeling in 1976, Entity-Relationship database has become a hot spot for research. With the advent of the big data, it appears that Entity-Relationship database is substituted for attribute reduction map structure. In the big data we have no evidence of the relationship but only of attributes and maps. In this paper we give an attribute representation of the relationship. In fact we assume that any entity can be in two different attributes states with two different values. One is the attribute that sends a message that we denote as e1 and the other is to receive the message that we denote as e2. The values of the attributes are the names of the entities. A relationship is a superposition ae1i¾?+i¾?be2 of the two states. When we change the values of the states we change the database. When we change the two states in the same way we have isomorphism among database, and when we change the two states in different way we have isomorphism with distortion homotopic transformation. Given a set of independent data base we can generate compute all the other data base in a dynamical way. In this way we can reduce the database that we must memorize. Because we are interested in the generation of the form morphology of database we denote this new model of computation as morphogenetic computing.