Maintaining stream statistics over sliding windows (extended abstract)

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 635-644

  Datar, Mayur ^a   Gionis, Aristides ^a   Indyk, Piotr ^b   Motwani, Rajeev ^a  

^a Stanford University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATES; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING;

COUNTING PROBLEMS; DATA ELEMENTS; EXTENDED ABSTRACTS; POSITIVE INTEGERS; RANDOMIZED ALGORITHMS; SLIDING WINDOW; SLIDING WINDOW MODELS; UPPER AND LOWER BOUNDS;

ALGORITHMS;

EID: 84968735289     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. N. Alon, Y. Matias, M. Szegedy. The space complexity of approximating the frequency moments. In Proc. Twenty-Eighth Annual ACM Symposium on Theory of Computing, 1996.
2. C. Cortes, K. Fisher, D. Pregibon, A. Rogers. Hancock: a language for extracting signatures from data streams. In Proc. 2000 ACM SIGKDD, pp. 9-17, 2000.
3. S. Chaudhuri, R. Motwani, V. R. Narasayya. On random sampling over joins. In Proc. 1999 ACM SIGMOD, pp. 263-274, 1999.
4. M. Fang, H. Garcia-Molina, R. Motwani, N. Shivaku-mar, J.D. Ullman. Computing iceberg queries efficiently. In Proc. 24th International Conference on Very Large Data Bases (VLDB), 1998.
5. J. Feigenbaum, S. Kaiuian, M. Strauss, M. Viswanathan. An Approximate LI-Difference Algorithm for Massive Data Streams. In Proc. 40th Symposium on Foundations of Computer Science, 1999.
6. P. Flajolet, G. Martin. Probabilistic Counting. In Proc. 24th Symposium on Foundations of Computer Science, 1983.
7. C. Fraleigh, S. Moon, C. Diot, B. Lyles, F. Tobagi. Architecture of a passive monitoring system for backbone IP networks. Technical Report TR00-ATL-101-801, Sprint Labs, 2000.
8. S. Guha, N. Koudas, K. Shim. Data-Streams and Histograms. To appear in Proc. Thirty-Third Annual ACM Symposium on Theory of Computing, 2001.
9. S. Guha, N. Mishra, R. Motwani, L. O'Callaghan. Clustering data streams. In Proc. 2000 Annual IEEE Symp. on Foundations of Computer Science, pages 359-366, 2000.
10. M. R. Henzinger, P. Raghavan, S. Rajagopalan. Computing on data streams. Technical Report TR 1998-011, Compaq Systems Research Center, Palo Alto, California, May 1998.
11. P. Indyk. Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. In Proc. 41st Symposium on Foundations of Computer Science, 2000.
12. Jagadish, Koudas, Muthukrishnan, Poosala, Sevcik, Suel. Optimal Histograms with Quality Guarantees. In Proc. 24th International Conference on Very Large Data Bases (VLDB), 1998.
13. R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
14. Netflow Services and Applications. Whitepaper, Cisco Systems, 2000. Available at http://www.cisco.com/warp/public/cc/pd/iosw/ioft/neflct/tech/nappe, wp.html.