Stanford InfoLab Publication Server

Sliding Window Computations over Data Streams

Babcock, Brian and Datar, Mayur and Motwani, Rajeev and O'Callaghan, Liadan (2002) Sliding Window Computations over Data Streams. Technical Report. Stanford InfoLab.

WarningThere is a more recent version of this item available.



We extend the work from our earlier paper (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:Techreport (Technical Report)
Uncontrolled Keywords:sliding windows, variance, clustering, k-medians
Subjects:Computer Science > Data Streams
Related URLs:Project Homepage
ID Code:538
Deposited By:Import Account
Deposited On:06 May 2002 17:00
Last Modified:25 Dec 2008 08:34

Available Versions of this Item

Download statistics

Repository Staff Only: item control page