Data Allocation in Distributed Data Base in the Network Using Modularization Algorithm

ABSTRACT- Data allocation issue is one of the significant and essential discussions in distributed data base systems. In these systems, operators are located in different places and have to get access to a joint data base. These data have been distributed within the network. Many models have been designed in order to resolve this problem. Also, some algorithms are devised for the purpose of decreasing data transferring expense and decreasing the time of responding. The most important expense belongs to data transferring. This cost equals to a query´s access to the required data from different sites to the place in which the query has been produced. In this article, we deal with modularization algorithms which make data transferring expense reduce during a query execution. These algorithms accomplish this by optional modularization of the sites in which the data are located.