A Generalized Data Distribution Model for Distributed Relational Databases

Publication Year:
1989
Usage 6
Downloads 6
Repository URL:
https://scholarworks.wmich.edu/masters_theses/1160
Author(s):
Yurk, Patrick D.
thesis / dissertation description
This thesis presents a generalized model for the allocation of data in a distributed relational database. The model is applicable to a network of computers where there are different retrieval and update costs at the various sites, and different communication costs between sites.The method used in this model is based upon clustering of similar computers within the network. Clusters are derived from grouping together sites with similar update, retrieval and communication costs. Data is then allocated to a cluster based on actual communication and processing costs.The data distribution method between clusters uses a technique where the benefit of allocating data to a cluster is computed as the difference between the cost of not allocating the data to the cluster and the cost of allocating the data to the cluster. The algorithm will then attempt to maximize the total benefits for the clustered network. (Abstract shortened with permission of author.)