Evaluating MAX and MIN over sliding windows with various size using the exemplary sketch

Authors:
Jiakui Zhao;Dongqing Yang;Bin Cui;Lijun Chen;Jun Gao
Affiliations:
School of EECS, Peking University, Beijing, China;School of EECS, Peking University, Beijing, China;School of EECS, Peking University, Beijing, China;School of EECS, Peking University, Beijing, China;School of EECS, Peking University, Beijing, China
Venue:
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Year:
2007

Citing 10
Cited 0

Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Distributed streams algorithms for sliding windows

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals

Data Mining and Knowledge Discovery
Continuous queries over data streams

ACM SIGMOD Record
Approximate counts and quantiles over sliding windows

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
No pane, no gain: efficient evaluation of sliding-window aggregates over data streams

ACM SIGMOD Record
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Semantics and evaluation techniques for window aggregates in data streams

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Streaming queries over streaming data

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Resource sharing in continuous sliding-window aggregates

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Quantified Score

Hi-index	0.01

Visualization

Abstract

MAX and MIN are two important aggregates offered by the original SQL specification. In the paper, we propose a novel mechanism, i.e. the exemplary sketch, to evaluate MAX and MIN over sliding windows with various size in the data stream environment. Performance analysis shows that evaluating MAX or MIN over w sliding windows with various size using the exemplary sketch takes O(ln n) expected amortized space and O(w) expected amortized evaluation time, where n is the number of the tuples fall into themaximal size sliding window. Moreover, the slidingwindow semantics can also be integrated into the exemplary sketch, which means that we no longer need to buffer all the tuples fall into current sliding windows separately for implementing the sliding-window semantics all alone. Experimental results show that the sketch scheme yields very good performance on both space and time cost.