Abstract
We address the problem of determining an allocation scheme for replicated data in a distributed database, with the purpose of minimizing required communication. An allocation scheme establishes the number of copies of each data-item, and at which processors of a given computer network the copies should be located. The problem for general networks is shown NP-Complete, but we provide efficient algorithms to obtain an optimal allocation scheme for three common types of network topologies. They are completely-connected, tree, and ring networks. We also propose a new method by which a processor in a computer network should write all the copies of a replicated data item. This method leads to surprising results concerning the allocation schemes.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. G. Casey, "Allocation of Copies of a File in an Information Network", Proc. 1972 Spring Joint Computer Conference, AFIPS, 1972.
S. Ceri, G. Martella, and G. Pelagatti, "Optimal File Allocation in a Computer Network: a Solution Method Based on the Knapsack Problem", Computer Networks, 6:5, 1982.
L. W. Dowdy and D. V. Foster, "Comparative Models of the File Assignment Problem", ACM Computing Surveys, 14:2, 1982.
K. B. Irani and N. G. Khabbaz, "A Methodology for the Design of Communication Networks and the Distribution of Data in Distributed Supercomputer Systems", IEEE Transactions on Computers, C-31:5, 1982.
A. Milo, M. Sc. Thesis, The Technion — IIT, Jan. 1988.
H. L. Morgan and J. D. Levin "Optimal Program and Data Location in Computer Networks", Communications of the ACM, 20:5, 1977.
S. Mahmoud and J. S. Riordon, "Optimal Allocation of Resources in Distributed Information Network", ACM-TODS, 1:1, 1976.
A. Segall and O. Wolfson, "Transaction Commitment at Minimal Communication Cost", Proc. 6th ACM Symp on Principles of Database Systems, 1987.
B. Zelinka, "Medians and Peripherians on Trees", Arch. Math. (Brno), 1968.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milo, A., Wolfson, O. (1988). Placement of replicated items in distributed databases. In: Schmidt, J.W., Ceri, S., Missikoff, M. (eds) Advances in Database Technology—EDBT '88. EDBT 1988. Lecture Notes in Computer Science, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19074-0_65
Download citation
DOI: https://doi.org/10.1007/3-540-19074-0_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19074-5
Online ISBN: 978-3-540-39095-4
eBook Packages: Springer Book Archive