Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Continuously adaptive continuous queries over streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Optimization of Nonrecursive Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Adaptive ordering of pipelined stream filters
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Adaptive Processing of Top-k Queries in XML
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Content-based routing: different plans for different data
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Lifting the burden of history from adaptive query processing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Foundations and Trends in Databases
Real-time, load-adaptive processing of continuous queries over data streams
Proceedings of the second international conference on Distributed event-based systems
Multiple continuous queries evaluation over data streams
ACS'08 Proceedings of the 8th conference on Applied computer scince
Self-tuning query mesh for adaptive multi-route query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Teddies: trained Eddies for reactive stream processing
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Sharing-aware horizontal partitioning for exploiting correlations during query processing
Proceedings of the VLDB Endowment
Dynamic routing of data stream tuples among parallel query plan running on multi-core processors
Distributed and Parallel Databases
Multi-route query processing and optimization
Journal of Computer and System Sciences
Optimizing adaptive multi-route query processing via time-partitioned indices
Journal of Computer and System Sciences
Driver input selection for main-memory multi-way joins
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
An eddy [2] is a highly adaptive query processing operator that continuously reoptimizes a query in response to changing runtime conditions. It does this by treating query processing as routing of tuples through operators and making per-tuple routing decisions. The benefits of such adaptivity can be significant, especially in highly dynamic environments such as data streams, sensor query processing, web querying, etc. Various parties have asserted that the cost of making per-tuple routing decisions is prohibitive. We have implemented eddies in the PostgreSQL open source database system [1] in the context of the TelegraphCQ project. In this paper, we present an "apples-to-apples" comparison of PostgreSQL query processing overhead with and without eddies. Our results show that with some minor tuning, the overhead of the eddy mechanism is negligible.