On data allocation with minimum overall communication costs in distributed database design

This paper investigates the problem of allocation of database fragments to a network, so that the overall communication cost for processing a given set of transactions is minimized. Presented first is a data allocation algorithm with respect to a "simple strategy" to process transactions. Secondly, we present a dynamic data allocation algorithm which is guaranteed to produce a "locally optimal" data allocation.<
>