1. Aggarwal C (2007) Data streams: models and algorithms. Advances in database systems.
http://www.springer.com/west/home/default?SGWID=4-40356-22-107949228-0
2. Arasu A, Manku GS (2004) Approximate counts and quantiles over sliding windows. In: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems (PODS’04). ACM, New York, pp 286–296. doi:10.1145/1055558.1055598
3. Babcock B, Babu S, Datar M, Motwani R, Widom J (2002) Models and issues in data stream systems. In: Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems (PODS’02). ACM, New York, pp 1–16. doi:10.1145/543613.543615
4. Babcock B, Datar M, Motwani R (2002) Sampling from a moving window over streaming data. In: Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms (SODA’02). Society for Industrial and Applied Mathematics, Philadelphia, pp 633–634.
http://dl.acm.org/citation.cfm?id=545381.545465
5. Babcock B, Datar M, Motwani R, O’Callaghan L (2003) Maintaining variance and k-medians over data stream windows. In: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (PODS’03). ACM, New York, pp 234–243. doi:10.1145/773153.773176