Scrambling Query Plans to Cope With Unexpected Delays
| dc.contributor.author | Amsaleg, Laurent | en_US |
| dc.contributor.author | Franklin, Michael J. | en_US |
| dc.contributor.author | Tomasic, A. | en_US |
| dc.contributor.author | Urhan., T. | en_US |
| dc.date.accessioned | 2004-05-31T22:39:14Z | |
| dc.date.available | 2004-05-31T22:39:14Z | |
| dc.date.created | 1996-05 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | Accessing numerous widely-distributed data sources poses significant new challenges for query optimization and execution. Congestion or failure in the network introduce highly-variable response times for wide-area data access. This paper is an initial exploration of solutions to this variability. We investigate a class of dynamic, run-time query plan modification techniques that we call query plan scrambling. We present an algorithm which modifies execution plans on-the-fly in response to unexpected delays in data access. The algorithm both reschedules operators and introduces new operators into the plan. We present simulation results that show how our technique effectively hides delays in receiving the initial requested tuples from remote data sources. (Also cross-referenced as UMIACS-TR-96-35) | en_US |
| dc.format.extent | 307400 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/818 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3645 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-96-35 | en_US |
| dc.title | Scrambling Query Plans to Cope With Unexpected Delays | en_US |
| dc.type | Technical Report | en_US |