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

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

2009-12-23

arxiv.org/abs/0912.4569v2

Computer Science

Data Structures and Algorithms

12 pages, to appear in the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), 2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-362769