1. N. Alon, Y. Matias, M. Szegedy, The space complexity of approximating the frequency moments, in Proc. of the 1996 Annual ACM Symp. on Theory of Computing (1996), pp. 20–29
2. A. Arasu, G. Manku, Approximate counts and quantiles over sliding windows. Technical report, Stanford University, Stanford, California (2004)
3. B. Babcock, M. Datar, R. Motwani, Sampling from a moving window over streaming data, in Proc. of the 2002 Annual ACM-SIAM Symp. on Discrete Algorithms (2002), pp. 633–634
4. B. Babcock, M. Datar, R. Motwani, L. O’Callaghan, Maintaining variance and k-medians over data stream windows, in Proc. of the 2003 ACM Symp. on Principles of Database Systems (2003), pp. 234–243
5. E. Cohen, M. Strauss, Maintaining time-decaying stream aggregates, in Proc. of the 2003 ACM Symp. on Principles of Database Systems (2003), pp. 223–233