Abstract.
An adaptive probe-based optimization technique is developed and demonstrated in the context of an Internet-based distributed database environment. More and more common are database systems which are distributed across servers communicating via the Internet where a query at a given site might require data from remote sites. Optimizing the response time of such queries is a challenging task due to the unpredictability of server performance and network traffic at the time of data shipment; this may result in the selection of an expensive query plan using a static query optimizer. We constructed an experimental setup consisting of two servers running the same database management system connected via the Internet. Concentrating on join queries, we demonstrate how a static query optimizer might choose an expensive plan by mistake. This is due to the lack of a priori knowledge of the run-time environment, inaccurate statistical assumptions in size estimation, and neglecting the cost of remote method invocation. These shortcomings are addressed collectively by proposing a probing mechanism. An implementation of our run-time optimization technique for join queries was constructed in the Java language and incorporated into an experimental setup. The results demonstrate the superiority of our probe-based optimization over a static optimization.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received 6 February 1999 / Revised 15 February 2000 / Accepted 10 May 2000
Rights and permissions
About this article
Cite this article
Shahabi, C., Khan, L. & McLeod, D. A Probe-Based Technique to Optimize Join Queries in Distributed Internet Databases. Knowledge and Information Systems 2, 373–385 (2000). https://doi.org/10.1007/PL00011648
Issue Date:
DOI: https://doi.org/10.1007/PL00011648