Scrambling Query Plans to Cope With Unexpected Delays (1996)
| Venue: | In PDIS |
| Citations: | 43 - 13 self |
BibTeX
@INPROCEEDINGS{Amsaleg96scramblingquery,
author = {Laurent Amsaleg and Michael J. Franklin and Anthony Tomasic and Tolga Urhan},
title = {Scrambling Query Plans to Cope With Unexpected Delays},
booktitle = {In PDIS},
year = {1996},
pages = {208--219},
publisher = {IEEE Computer Society}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. This 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 onthe -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. 1 Introduction Ongoing improvements in networking technology and infrastructure have resulted in a dramatic increase in the demand for accessing and collating data ...
Citations
No citations identified.
