Optimal allocation for partially replicated database systems on tree-based networks Original Research Article

We consider a partially replicated distributed database located on a tree network each of whose links may fail with probability p. For small p, we derive necessary conditions for optimal placement of replicated data in order to maximize the probabilities of successful read-only and write-only transactions. Using these conditions, we derive properties of optimal placements.