[ Pagewise preview ]
| Category | Value | ||
| Available via | http://dbpubs.stanford.edu/pub/2001-33 | ||
| Submitted on | 26th of September 2001 | ||
| Author | Babcock, Brian; Datar, Mayur; Motwani, Rajeev | ||
| Title | Sampling From a Moving Window Over Streaming Data | ||
| Date of publication | 2001 | ||
| Published in | 2002 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002) | ||
| Citation | Babcock, Brian; Datar, Mayur; Motwani, Rajeev. Sampling From a Moving Window Over Streaming Data, 2002 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002) | ||
| Number of pages | 2 | ||
| Language | English | ||
| Project | STREAM | ||
| Type | Other | ||
| Subject group | Data Streams; Miscellaneous | ||
| Abstract | We consider the problem of maintaining statistics over sliding windows. We design data structures with small memory requirements and provide matching lower bounds. | ||
| Fulltext source |
| Management of the document by | siroker@db.stanford.edu
| |
[ Pagewise preview ]