By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mahmoudie, R. ; Young researchers club, Qazvin Islamic Azad Univ., Qazvin, Iran ; Parsa, S.E.

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.

Published in:

Computer Modelling and Simulation (UKSim), 2010 12th International Conference on

Date of Conference:

24-26 March 2010