Subsuming multiple sliding windows for shared stream computation

Authors:
Kostas Patroumpas;Timos Sellis
Affiliations:
School of Electrical and Computer Engineering, National Technical University of Athens, Hellas;School of Electrical and Computer Engineering, National Technical University of Athens, Hellas and Institute for the Management of Information Systems, R.C. "Athena", Hellas
Venue:
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Year:
2011

Citing 14
Cited 0

Multiple-query optimization

ACM Transactions on Database Systems (TODS)
Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Exploiting Punctuation Semantics in Continuous Data Streams

IEEE Transactions on Knowledge and Data Engineering
No pane, no gain: efficient evaluation of sliding-window aggregates over data streams

ACM SIGMOD Record
Update-pattern-aware modeling and processing of continuous queries

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
The 8 requirements of real-time stream processing

ACM SIGMOD Record
On-the-fly sharing for streamed aggregation

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
The CQL continuous query language: semantic foundations and query execution

The VLDB Journal — The International Journal on Very Large Data Bases
Multi-query optimization of sliding window aggregates by schedule synchronization

CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Scheduling for shared window joins over data streams

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Resource sharing in continuous sliding-window aggregates

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Towards a streaming SQL standard

Proceedings of the VLDB Endowment
Maintaining consistent results of continuous queries under diverse window specifications

Information Systems
Multi-granular Time-Based Sliding Windows over Data Streams

TIME '10 Proceedings of the 2010 17th International Symposium on Temporal Representation and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Shared evaluation of multiple user requests is an utmost priority for stream processing engines in order to achieve high throughput and provide timely results. Given that most continuous queries specify windowing constraints, we suggest a multi-level scheme for concurrent evaluation of time-based sliding windows seeking for potential subsumptions among them. As requests may be registered or suspended dynamically, we develop a technique for choosing the most suitable embedding of a given window into a group composed of multi-grained time frames already employed for other queries. Intuitively, the proposed methodology "clusters" windowed operators into common hierarchical constructs, thus drastically reducing the need for their separate evaluation. Our empirical study confirms that such a scheme achieves dramatic memory savings with almost negligible maintenance cost.