Approximate counts and quantiles over sliding windows (2004)
Cached
Download Links
- [infolab.stanford.edu]
- [magna.cs.ucla.edu]
- [www-db.stanford.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In PODS |
| Citations: | 63 - 1 self |
BibTeX
@INPROCEEDINGS{Arasu04approximatecounts,
author = {Arvind Arasu},
title = {Approximate counts and quantiles over sliding windows},
booktitle = {In PODS},
year = {2004},
pages = {286--296}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We consider the problem of maintaining ɛ-approximate counts and quantiles over a stream sliding window using limited space. We consider two types of sliding windows depending on whether the number of elements N in the window is fixed (fixed-size sliding window) or variable (variable-size sliding window). In a fixed-size sliding window, both the ends of the window slide synchronously over the stream. In a variable-size sliding window, an adversary slides the window ends independently, and therefore has the ability to vary the number of elements N in the window. We present various deterministic and randomized algorithms for approximate counts and quantiles. All of our algorithms require O ( 1 1 polylog ( , N)) space. For quantiles, this space ɛ ɛ requirement is an improvement over the previous best bound of O ( 1 ɛ2 polylog ( 1, N)). We believe that no previous work ɛ on space-efficient approximate counts over sliding windows exists. 1.
