Babcock, Brian and Datar, Mayur and Motwani, Rajeev and O'Callaghan, Liadan (2003) Maintaining Variance and k-Medians over Data Stream Windows. In: ACM Symposium on Principles of Database Systems (PODS 2003), June 9-12, 2003, San Diego, California.
| BibTeX | DublinCore | EndNote | HTML |
This is the latest version of this item.
![[img]](/style/images/fileicons/application_pdf.png)
| PDF 207Kb |
Abstract
We extend the work from our earlier paper in SODA 2002 to maintain complex statistics in the sliding window model that cannot be estimated using previous techniques. In particular we consider the following two problems and provide solutions to them that require very less memory: estimating the variance and maintaining the cluster centers (k-medians).
| Item Type: | Conference or Workshop Item (Paper) | |
|---|---|---|
| Subjects: | Computer Science > Data Streams Miscellaneous | |
| Projects: | STREAM | |
| Related URLs: | Project Homepage | http://infolab.stanford.edu/stream/ |
| ID Code: | 749 | |
| Deposited By: | Import Account | |
| Deposited On: | 08 Mar 2003 16:00 | |
| Last Modified: | 24 Dec 2008 08:34 |
Available Versions of this Item
- Sliding Window Computations over Data Streams. (deposited 06 May 2002 17:00)
- Maintaining Variance and k-Medians over Data Stream Windows. (deposited 08 Mar 2003 16:00) [Currently Displayed]
Download statistics
Repository Staff Only: item control page
