Maintaining Significant stream statistics over sliding windows

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 724-732

  Lee, L K ^a   Ting, H F ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; PARAMETER ESTIMATION; PROBLEM SOLVING; QUERY LANGUAGES;

MEMORY BOUND; RELATIVE ERRORS; SIGNIFICANT ONE COUNTING PROBLEM;

ERROR ANALYSIS;

EID: 33244489178     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109636     Document Type: Conference Paper

References (20)

1. A. Arasu and G. Manku. Approximate counts and quantiles over sliding windows. In Proc. 23rd ACM Symp. on Principles of Database Systems (PODS), 2004.
2. B. Babcock, M. Datar, and R. Motwani. Sampling from a moving window over streaming data. In Proc. 13th annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 633-634, 2002.
3. B. Babcock, M. Datar, R. Motwani, and L. O'Callaghan. Maintaining variance and k-medians over data stream windows. In Proc. of 22nd Symp. on Principles of Database Systems (PODS), 2003.
4. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP), 2002.
5. G. Cormode and S. Muthukrishnan. What's hot and what's not: Tracking most frequent items dynamically. In Proc. of A CM Principles of Database Systems (PODS), 2003.
6. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. In Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 635-644, 2002.
7. M. Datar and S. Muthukrishnan. Estimating rarity and similarity over data stream windows. In Proc. of European Symposium of Algorithms (ESA), 2002.
8. E. D. Demaine, A. Lopez-Ortiz, and J. I. Munro. Frequency estimation of internet packet streams with limited space. In Proc. the European Symposium on Algorithms (ESA), pages 348-360, 2002.
9. C. Estan and G. Varghese. New directions in traffic measurement and accounting. In Proc. ACM SIGCOMM, 2002.
10. p-difference algorithm for massive data streams. In Proc. 17th Symp. on Theoretical Aspects of Computer Science (STACS), pages 193-204, 2000.
11. P. B. Gibbons and Y. Matias. New sampling-based summary statistics for improving approximate query answers. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 331-342, 1998.
12. P. B. Gibbons and Y. Matias. Synopsis data structures for massive data sets. In J. M. Abello and J. S. Vitter, editors, External Memory Algorithms, number 50 in DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, pages 39-70. AMS, 1999. A two page summary appeared as a short paper in SODA'99.
13. P. B. Gibbons and S. Tirthapura. Estimating simple functions on the union of data streams. In Proc. 13th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 281-290, 2001.
14. P. B. Gibbons and S. Tirthapura. Distributed streams algorithms for sliding windows. In Proc. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 63-72, 2002.
15. A. C. Gilbert, Y. Kotidis, and M. J. Strauss. Surfing wavelets on streams: One-pass summaries for approximate aggregate queries. In Proc. 27th International Conf. on Very Large Data Bases (VLDB), pages 79-88, 2001.
16. S. Guha, N. Koudas, and K. Shim. Data-streams and histograms. In Proc. 33rd ACM Symp. on Theory of Computing (STOC), pages 471-475, 2001.
17. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In Proc. 41st IEEE Symp. on Foundations of Computer Science (FOCS), pages 189-197, 2000.
18. C. Jin, W. Qian, C. Sha, J. X. Yu, and A. Zhou. Dynamically maintaining frequent items over a data stream. In Proc. of the ACM International Conf. on Information and Knowledge Management (CIKM), 2003.
19. R. M. Karp, S. Shenker, and C. H. Papadimitriou. A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems (TODS), 28:51-55, 2003.
20. A. Manjhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. Finding (recently) frequent items in distributed data streams. In Proc. 21st International Conference on Data Engineering (ICDE), 2005.