Parallel and Distributed Information Systems, International Conference (1996)
Dec. 18, 1996 to Dec. 20, 1996
L. Amsaleg , Maryland Univ., MD, USA
A. Tomasic , Maryland Univ., MD, USA
M.J. Franklin , Maryland Univ., MD, USA
T. Urhan , Maryland Univ., MD, USA
Abstract: Accessing data from numerous widely distributed sources poses significant new challenges for query optimization and execution. Congestion and failures in the network can introduce highly variable response times for wide area data access. The paper is an initial exploration of solutions to this variability. We introduce a class of dynamic, run time query plan modification techniques that we call query plan scrambling. We present an algorithm that modifies execution plans on-the-fly in response to unexpected delays in obtaining initial requested tuples from remote sources. The algorithm both reschedules operators and introduces new operators into the query plan. We present simulation results that demonstrate how the technique effectively hides delays by performing other useful work while waiting for missing data to arrive.
query processing; unexpected delays; data access; widely distributed sources; query optimization; highly variable response times; wide area data access; run time query plan modification techniques; query plan scrambling; initial requested tuples; remote sources; missing data
A. Tomasic, M. Franklin, L. Amsaleg and T. Urhan, "Scrambling Query Plans to Cope with Unexpected Delays," Parallel and Distributed Information Systems, International Conference(PDIS), vol. 00, no. , pp. 0208, 1996.