Using State Modules for Adaptive Query Processing (2003)
Cached
Download Links
- [www.cs.brown.edu]
- [www.cs.berkeley.edu]
- [www.cs.umd.edu]
- [web.cs.wpi.edu]
- [www.cs.umd.edu]
- [db.cs.berkeley.edu]
- [db.cs.berkeley.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In ICDE |
| Citations: | 63 - 8 self |
BibTeX
@INPROCEEDINGS{Raman03usingstate,
author = {Vijayshankar Raman and Vijayshankar Raman and Amol Deshpande and Amol Deshpande and Joseph M. Hellerstein and Joseph M. Hellerstein},
title = {Using State Modules for Adaptive Query Processing},
booktitle = {In ICDE},
year = {2003},
pages = {353--364}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed adaptively by an Eddy routing operator. Breaking the encapsulation of joins serves two purposes. First, it allows the Eddy to observe multiple physical operations embedded in a join algorithm, allowing for better calibration and control of these operations. Second, the SteM on a relation serves as a shared materialization point, enabling multiple competing access methods to share results, which can be leveraged by multiple competing join algorithms. Our architecture extends prior work significantly, allowing continuously adaptive decisions for most major aspects of traditional query optimization: choice of access methods and join algorithms, ordering of operators, and choice of a query spanning tree. SteMs introduce...
Keyphrases
state module adaptive query processing join algorithm access method prior work multiple physical operation stem introduce traditional query optimization share result join serf shared materialization point major aspect query architecture adaptive decision eddy routing operator join operator constituent data structure
