An incremental access method for ViewCache: concept, algorithms, and cost analysis
ACM Transactions on Database Systems (TODS)
Query execution techniques for caching expensive methods
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Materialized view maintenance and integrity constraint checking: trading space for time
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Efficient mid-query re-optimization of sub-optimal query execution plans
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Cost-based query scrambling for initial delays
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
View indexing in relational databases
ACM Transactions on Database Systems (TODS)
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Making views self-maintainable for data warehousing
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Exploiting statistics on query expressions for optimization
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Performance Issues in Incremental Warehouse Maintenance
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
LEO - DB2's LEarning Optimizer
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient query processing for data integration
Efficient query processing for data integration
Adaptive ordering of pipelined stream filters
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Dynamic plan migration for continuous queries over data streams
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Robust query processing through progressive optimization
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
StreaMon: an adaptive engine for stream query processing
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Monitoring streams: a new class of data management applications
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Maximizing the output rate of multi-way join queries over streaming information sources
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Processing sliding window multi-joins in continuous queries over data streams
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Lifting the burden of history from adaptive query processing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The CQL continuous query language: semantic foundations and query execution
The VLDB Journal — The International Journal on Very Large Data Bases
State-slice: new paradigm of multi-query optimization of window-based stream queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
In-network execution of monitoring queries in sensor networks
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
HybMig: A Hybrid Approach to Dynamic Plan Migration for Continuous Queries
IEEE Transactions on Knowledge and Data Engineering
Foundations and Trends in Databases
Journal of Systems and Software
Multiple continuous queries evaluation over data streams
ACS'08 Proceedings of the 8th conference on Applied computer scince
Semantics and implementation of continuous sliding window queries over data streams
ACM Transactions on Database Systems (TODS)
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Measuring evolving data streams' behavior through their intrinsic dimension
New Generation Computing
Query result caching for multiple event-driven continuous queries
Information Systems
Supporting views in data stream management systems
ACM Transactions on Database Systems (TODS)
Optimizing joins in a map-reduce environment
Proceedings of the 13th International Conference on Extending Database Technology
Distributed stream join query processing with semijoins
Distributed and Parallel Databases
A new look at generating multi-join continuous query plans: A qualified plan generation problem
Data & Knowledge Engineering
Feeding frenzy: selectively materializing users' event feeds
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Processing exact results for sliding window joins over data streams using disk storage
International Journal of Intelligent Information and Database Systems
A native and adaptive approach for unified processing of linked streams and linked data
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Dynamic plan migration for snapshot-equivalent continuous queries in data stream systems
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Distributed Adaptive Windowed Stream Join Processing
International Journal of Distributed Systems and Technologies
Exploring optimization and caching for efficient collection operations
Automated Software Engineering
Hi-index | 0.00 |
We address the problem of executing continuous multiway join queries in unpredictable and volatile environments. Our query class captures windowed join queries in data stream systems as well as conventional maintenance of materialized join views. Our adaptive approach handles streams of updates whose rates and data characteristics may change over time, as well as changes in system conditions such as memory availability. In this paper we focus specifically on the problem of adaptive placement and removal of caches to optimize join performance. Our approach automatically considers conventional tree-shaped join plans with materialized subresults at every intermediate node, subresult-free MJoins, and the entire spectrum between them. We provide algorithms for selecting caches, monitoring their cost and benefits in current conditions, allocating memory to caches, and adapting as conditions change. All of our algorithms are implemented in the STREAM prototype Data Stream Management System and a thorough experimental evaluation is included.