A self-processing network model for relational databases

Abstract

In this paper, a model which combines relational databases with self-processing networks is proposed in order to improve the performance of very large databases. The proposed model uses an approach which is radically different from all other distributed database models, where each computer processes a portion of the database. In the self-processing network model, the network structure which consists of nodes and connections, captures the data and the relationships by assigning them unique, connected control, and data nodes. The network activity is the mechanism that performs the relational algebra operations. No data transmission is needed, and since data nodes are common to all the relations, integrity and elimination of data redundancy are achieved. An extension of the model, by interconnecting the data nodes via weighted links, provides us with properties that are embedded in neural networks, such as fuzziness and learning.