DMCA
Eddies: Continuously Adaptive Query Processing (2000)
Cached
Download Links
- [db.cs.berkeley.edu]
- [db.cs.berkeley.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In SIGMOD |
| Citations: | 408 - 21 self |
BibTeX
@INPROCEEDINGS{Avnur00eddies:continuously,
author = {Ron Avnur and Joseph M. Hellerstein},
title = {Eddies: Continuously Adaptive Query Processing},
booktitle = {In SIGMOD},
year = {2000},
pages = {261--272}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In large federated and shared-nothing databases, resources can exhibit widely fluctuating characteristics. Assumptions made at the time a query is submitted will rarely hold throughout the duration of query processing. As a result, traditional static query optimization and execution techniques are ineffective in these environments. In this paper we introduce a query processing mechanism called an eddy, which continuously reorders operators in a query plan as it runs. We characterize the moments of symmetry during which pipelined joins can be easily reordered, and the synchronization barriers that require inputs from different sources to be coordinated. By combining eddies with appropriate join algorithms, we merge the optimization and execution phases of query processing, allowing each tuple to have a flexible ordering of the query operators. This flexibility is controlled by a combination of fluid dynamics and a simple learning algorithm. Our initial implementation demonstrates prom...
Keyphrases
adaptive query processing query processing synchronization barrier execution technique query operator simple learning algorithm execution phase different source flexible ordering query plan query processing mechanism shared-nothing database appropriate join algorithm traditional static query optimization initial implementation fluid dynamic
