The Community for Technology Leaders
Green Image
<p>Considers a distributed database with partial replication of data objects located on a ring network. Certain placements of replicated objects are shown to optimize the probability of read-only success and the probability of write-only success. We also obtain optimal placements for k-terminal reliability and expected minimal path length for read-only and write-only operations.</p>
replicated databases; token networks; probability; optimisation; reliability; distributed databases; software reliability; storage allocation; resource allocation; optimal allocation; partially replicated database systems; ring networks; distributed database; data objects; object placement; read-only success probability; write-only success probability; optimal placements; k-terminal reliability; expected minimal path length; ring topology

A. Stephens, K. Humenik and Y. Yesha, "Optimal Allocation for Partially Replicated Database Systems on Ring Networks," in IEEE Transactions on Knowledge & Data Engineering, vol. 6, no. , pp. 975-982, 1994.
80 ms
(Ver 3.3 (11022016))