Variance estimation over sliding windows

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2007, Pages 225-232

  Zhang, Linfeng ^a   Guan, Yong ^a  

^a Iowa State University   (United States)

Author keywords

Data mining; Data streams; Sliding windows; Variance estimation

Indexed keywords

DATA STREAMS; SLIDING WINDOWS; VARIANCE ESTIMATION;

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; DATA MINING; DATA PROCESSING; PROBLEM SOLVING;

PARAMETER ESTIMATION;

EID: 35448989375     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1265530.1265562     Document Type: Conference Paper

References (11)

1. A. Arasu and G. S. Manku. Approximate counts and quantiles over sliding windows. In Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2004), Paris, France, June 2004.
2. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002), pages 1-16, Madison, USA, June 2002.
3. B. Babcock, M. Datar, R. Motwani, and L. O'Callaghan. Maintaining variance and k-medians over data stream windows. In Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2003), pages 234-243, San Diego, USA, June 2003.
4. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pages 635-644, San Francisco, USA, Jan. 2002.
5. J. Feigenbaum, S. Kannan, and J. Zhang. Computing diameter in the streaming and sliding-window models. Algorithmica, 41(1):25-41, 2004.
6. P. B. Gibbons and S. Tirthapura. Distributed streams algorithms for sliding windows. In Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2002), Winnipeg, Manitoba, Canada, Aug. 2002.
7. L. Golab, D. DeHaan, E. D. Demaine, A. López-Ortiz, and J. I. Munro. Identifying frequent items in sliding windows over on-line packet streams. In Proceedings of the Internet Measurement Conference (IMC 2003), Miami, USA, Oct. 2003.
8. X. Lin, H. Lu, J. Xu, and J. X. Yu. Continuously maintaining quantile summaries of the most recent N elements over a data stream. In Proceedings of the 20th International Conference on Data Engineering (ICDE 2004), Boston, USA, Mar. 2004.
9. S. Muthukrishnan. Data streams: Algorithms and applications. Technical report, Rutgers University, Piscataway, USA, 2003.
10. S. Tirthapura, B. Xu, and C. Busch. Sketching asynchronous streams over sliding windows. In Proceedings of the 25th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2006), Denver, USA, July 2006.
11. Y. Zhu and D. Shasha. Statstream: Statistical monitoring of thousands of data streams in real time. In Proceedings of 28th International Conference on Very Large Data Bases (VLDB 2002), Hong Kong, China, Aug. 2002.