A heuristic algorithm for determining a near-optimal set of nodes to access in a partially replicated distributed database system

An O(n/sup 2/) heuristic algorithm using randomized decisions is developed for determining a near-optimal set of nodes. For small values of n, the authors can determine how close the heuristic solution is to the optimal set of nodes. They also compare their heuristic to other algorithms reported in the literature.<
>