Show simple item record

Scrambling Query Plans to Cope With Unexpected Delays

dc.contributor.authorAmsaleg, Laurenten_US
dc.contributor.authorFranklin, Michael J.en_US
dc.contributor.authorTomasic, A.en_US
dc.contributor.authorUrhan., T.en_US
dc.date.accessioned2004-05-31T22:39:14Z
dc.date.available2004-05-31T22:39:14Z
dc.date.created1996-05en_US
dc.date.issued1998-10-15en_US
dc.identifier.urihttp://hdl.handle.net/1903/818
dc.description.abstractAccessing 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.extent307400 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3645en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-96-35en_US
dc.titleScrambling Query Plans to Cope With Unexpected Delaysen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record