Chan, HoLeung ;
Lam, TakWah ;
Lee, LapKei ;
Ting, HingFung
Continuous Monitoring of Distributed Data Streams over a Timebased 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 timebased sliding window (which contains a variable number of items and possibly outoforder 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 communicationefficient algorithms for three classical statistics, namely, basic counting, frequent items and quantiles. The worstcase communication cost over a window is
$O(\frac{k}{\varepsilon} \log \frac{\varepsilon N}{k})$ bits for basic counting and $O(\frac{k}{\varepsilon} \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 $\varepsilon < 1$ is the desired error bound. Matching and nearly matching lower bounds are also obtained.
BibTeX  Entry
@InProceedings{chan_et_al:LIPIcs:2010:2453,
author = {HoLeung Chan and TakWah Lam and LapKei Lee and HingFung Ting},
title = {{Continuous Monitoring of Distributed Data Streams over a Timebased Sliding Window}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {179190},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783939897163},
ISSN = {18688969},
year = {2010},
volume = {5},
editor = {JeanYves Marion and Thomas Schwentick},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2453},
URN = {urn:nbn:de:0030drops24536},
doi = {10.4230/LIPIcs.STACS.2010.2453},
annote = {Keywords: Algorithms, distributed data streams, communication efficiency, frequent items}
}
09.03.2010
Keywords: 

Algorithms, distributed data streams, communication efficiency, frequent items 
Seminar: 

27th International Symposium on Theoretical Aspects of Computer Science

Issue date: 

2010 
Date of publication: 

09.03.2010 