# Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window

Abstract : The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distributed data streams over a time-based sliding window (which contains a variable number of items and possibly out-of-order items). The concern is how to minimize the communication between individual streams and the root, while allowing the root, at any time, to be able to report the global statistics of all streams within a given error bound. This paper presents communication-efficient algorithms for three classical statistics, namely, basic counting, frequent items and quantiles. The worst-case communication cost over a window is $O(\frac{k} {\epsilon} \log \frac{\epsilon N}{k})$ bits for basic counting and $O(\frac{k}{\epsilon} \log \frac{N}{k})$ words for the remainings, where $k$ is the number of distributed data streams, $N$ is the total number of items in the streams that arrive or expire in the window, and $\epsilon < 1$ is the desired error bound. Matching and nearly matching lower bounds are also obtained.
Keywords :
Type de document :
Communication dans un congrès
Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.179-190, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science

Littérature citée [29 références]

https://hal.inria.fr/inria-00456120
Contributeur : Publications Loria <>
Soumis le : vendredi 12 février 2010 - 10:07:44
Dernière modification le : lundi 20 novembre 2017 - 15:14:01
Document(s) archivé(s) le : vendredi 18 juin 2010 - 20:19:43

### Fichier

chan.pdf
Fichiers produits par l'(les) auteur(s)

### Identifiants

• HAL Id : inria-00456120, version 1

### Citation

Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee, Hing-Fung Ting. Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window. Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.179-190, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science. 〈inria-00456120〉

### Métriques

Consultations de la notice

## 205

Téléchargements de fichiers