Skip Navigation

The Computer Journal 1990 33(1):61-70; doi:10.1093/comjnl/33.1.61
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Martin, T. P.
Right arrow Articles by Russell, J. I.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An Evaluation of Site Selection Algorithms for Distributed Query Processing

T. P. Martin *, K. H. Lam and J. I. Russell

Department of Computing and Information Science, Queen's University, Kingston, Ontario, Canada K7L 3N6

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.

Received May 1989. revised August 1989.

* This work was supported by the Natural Science and Engineering Research Council of Canada.

§ Department of Computing and Information Science, Queen's University, Kingston, Ontario, Canada K7L 3N6


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.