Abstract
The file allocation problem for distributed databases has been extensively studied in the literature and the objective is to minimize total costs consisting of storage, query and update communication costs. Current modeling of update communication costs is simplistic and does not capture the working of most of the protocols that have been proposed. This paper shows that more accurate modeling of update costs can be achieved fairly easily without an undue increase in the complexity of the formulation. In particular, formulations for two classes of update protocols are shown. Existing heuristics can be used on these formulations to obtain good solutions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Adiba, J. C. Chupin, R. Demolombe, G. Gardarin, and J. LeBihan, Issues in distributed database management systems: A technical overview, inTutorial: Centralized and Distributed Database Systems, W. W. Chu and P. P. Chen (eds), IEEE (1979).
J. B. Rothnie and N. Goodman, A survey of research and development in distributed database management,Procs. of The Third International Conf. on Very Large Databases, IEEE, pp. 30–44 (1977).
G. Bucci and D. N. Streeter, A methodology for the design of distributed information systems,Commun, of the ACM 22(4):233–245 (April 1979).
R. G. Casey, Allocation of file copies in an information network,Proceedings AFIPS 1972 Spring Joint Computer Conf., AFIPS Press,40:617–625 (1972).
W. W. Chu, Optimal File allocation in a computer network, inComputer Communication Networks, F. F. Kuo (ed.), Prentice-Hall, Englewood Cliffs, New Jersey (1973).
L. W. Dowdy and D. V. Foster, Comparative models of the file assignment problem,ACM Computing Surveys 14(2):287–313 (June 1982).
M. Hatzopoulos and J. G. Kollias, The file allocation problem under dynamic usage,Inform. Systems 5:197–201, Pergammon Press, (1980).
K. D. Levin and H. L. Morgan, A dynamic optimization model for distributed databases,Operations Research 26(5):824–835 (1978).
S. Mahmoud and J. S. Riordan, Optimal allocation of resources in distributed information networks,ACM Transactions on Database Systems 1(1):66–78 (March 1976).
H. L. Morgan and K. D. Levin, Optimal program and data locations in computer networks,Communications of the ACM 20(5):315–322 (May 1977).
C. A. Ellis, A robust algorithm for updating duplicate databases,Proc. 2nd. Berkeley Workshop on Distributed Data Management and Computer Networks, (1977).
A. P. Mullery, The distributed control of multiple copies of data,IBM Research Report, RC5782 (August 1975).
P. A. Bernstein, J. B. Rothnie, N. Goodman, and C. A. Papadimitriou, The concurrency control mechanism of SDD-1: A system for distributed databases,IEEE Transactions on Software Engineering, SE-44,3:154–168 (May 1978).
R. H. Thomas, A solution to the concurrency control problem for multiple copy databases,Digest of Papers COMPCON 78 Spring, IEEE.
P. A. Alsberg and J. D. Day, A principle for resilient sharing of distributed resources,Report from Center for Advanced Computation, University of Illinois at Urbana-Champaign, Urbana, Illinois (1976).
L. Van Sickle and K. M. Chandy, The complexity of computer network design problems, inComputers and Intractibility, M. D. Garey and D. S. Johnson, W. H. Freeman and Company, San Francisco (1977).
L. Cooper, Heuristic methods for location allocation problems,SIAM Review 6(1):37–53 (January 1964).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dutta, A. Modeling of multiple copy update costs for file allocation in distributed databases. International Journal of Computer and Information Sciences 14, 29–34 (1985). https://doi.org/10.1007/BF00990899
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00990899