Scheduling data redistribution in distributed databases

In a distributed database system there is a need for periodic changes in data distribution due to such factors as changes in query patterns and network topology. A proper redistribution of data is necessary to provide acceptable system performance, as measured by the average execution time of transactions. The problem of properly scheduling data transfers in order to complete this redistribution process in minimum possible time is investigated. This problem takes into account the constraints on communication resources of the system. The complexity of the problem is discussed, and a useful upper bound for optimal solutions is presented. Also given are procedures for finding optimal and approximate solutions to this problem