Optimal Placement of Replicated Items in Distributed Databases on Tree-LikeNetworks

摘要

An issue concerning the optimal placement of replicated items in distributeddatabases is studied. A reasonable cost function was previously proposed that models the tradeoff between the retrieval and update costs of replicated data and their location in a communication network. For networks that have a tree structure, we present a linear time data allocation scheme that minimizes this cost function.