Time-decaying aggregates in out-of-order streams
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimal sampling from sliding windows
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Competitive Analysis of Aggregate Max in Windowed Streaming
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Measuring independence of datasets
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the forty-second ACM symposium on Theory of computing
Time-decaying Sketches for Robust Aggregation of Sensor Data
SIAM Journal on Computing
Optimal sampling from sliding windows
Journal of Computer and System Sciences
Survey: Streaming techniques and data aggregation in networks of tiny artefacts
Computer Science Review
| Hi-index | 0.00 |
In the streaming model, elements arrive sequentially and can be observed only once. Maintaining statistics and aggregates is an important and non-trivial task in the model. This becomes even more challenging in the sliding windows model, where statistics must be maintained only over the most recent n elements. In their pioneering paper, Datar, Gionis, Indyk and Motwani [15] presented exponential histograms, an effective method for estimating statistics on sliding windows. In this paper we present a new smooth histograms method that improves the approximation error rate obtained via exponential histograms. Furthermore, our smooth histograms method not only captures and improves multiple previous results on sliding windows but also extends the class functions that can be approximated on sliding windows. In particular, we provide the first approximation algorithms for the following functions: L_p norms for p\in [1, 2], frequency moments, length of increasing subsequence and geometric mean.