Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Continuously adaptive continuous queries over streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Continuous queries over data streams
ACM SIGMOD Record
Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Aurora: a new model and architecture for data stream management
The VLDB Journal — The International Journal 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
Query indexing with containment-encoded intervals for efficient stream processing
Knowledge and Information Systems
Adaptive schemes for location update generation in execution location-dependent continuous queries
Journal of Systems and Software
Adaptive Query Optimization Method for Multiple Continuous Queries
ICDEW '05 Proceedings of the 21st International Conference on Data Engineering Workshops
Optimization of multiple continuous queries over streaming satellite data
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Optimization of continuous queries with shared expensive filters
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Streaming queries over streaming data
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Monitoring streams: a new class of data management applications
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Load shedding in a data stream manager
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Operator scheduling in a data stream manager
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A false negative approach to mining frequent itemsets from high speed transactional data streams
Information Sciences: an International Journal
Making filters smart in distributed data stream environments
Information Sciences: an International Journal
Frequency-based load shedding over a data stream of tuples
Information Sciences: an International Journal
M-COPE: a multiple continuous query processing engine
Proceedings of the 18th ACM conference on Information and knowledge management
XML filtering with XPath expressions containing parent and ancestor axes
Information Sciences: an International Journal
Adaptive two-level optimization for selection predicates of multiple continuous queries
Journal of Intelligent Information Systems
Hi-index | 0.07 |
The filtering of incoming tuples of a data stream should be completed quickly and continuously, which requires strict time and space constraints. In order to guarantee these constraints, the selection predicates of continuous queries are grouped or indexed in most data stream management systems (DSMS). This paper proposes a new scheme called attribute selection construct (ASC). Given a set of continuous queries, an ASC divides the domain of an attribute of a data stream into a set of disjoint regions based on the selection predicates that are imposed on the attribute. Each region maintains the pre-computed matching results of the selection predicates. Consequently, an ASC can collectively evaluate all of its selection predicates at the same time. Furthermore, it can also monitor the overall evaluation statistics, such as its selectivity and tuple dropping ratio, dynamically. For those attributes that are employed to express the selection predicates of the queries, the processing order of their ASC's can significantly influence the overall performance of a multiple query evaluation. The evaluation sequence can be optimized by periodically capturing the run-time tuple dropping ratio of its current evaluation sequence. The performance of the proposed method is analyzed by a series of experiments to identify its various characteristics.