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.
CITATION STYLE
Milo, A., & Wolfson, O. (1988). Placement of replicated items in distributed databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 303 LNCS, pp. 414–427). Springer Verlag. https://doi.org/10.1007/3-540-19074-0_65
Mendeley helps you to discover research relevant for your work.