An Evaluation of Site Selection Algorithms for Distributed Query Processing
T. Patrick Martin · The Computer Journal · 1990
Site selection in distributed query processing is a computationally intractable problem. We report on experiments comparing solutions from four algorithms — branch-and-bound, greedy, local search and simulated annealing. The algorithms are evaluated with respect to the total query costs obtained for a range of queries for both partially-replicated and fully-replicated databases. We demonstrate the cost-effectiveness of sophisticated algorithms for site selection during the optimization of compiled queries in a large, replicated, distributed database system.