Sampling from a moving window over streaming data

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 633-634

  Babcock, Brian ^a   Datar, Mayur ^a   Motwani, Rajeev ^a  

^a Stanford University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS;

DATA ELEMENTS; FIXED NUMBERS; HIGH PROBABILITY; MOVING WINDOW; RESERVOIR SAMPLINGS; SAMPLING PROBLEMS; STREAMING DATA; TIME DURATION;

ALGORITHMS;

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

References (6)

1. [l] C. R. Aragon and R. G. Seidel, Randomized Search Trees, Proc. of the 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 540-545.
2. S. Babu and J. Widom. Continuous Queries over Data Streams, ACM SIGMOD Record, 30.3, 2001, 109-120.
3. K. Muhnuley, Computational Geometry; An Introduction through Randomized Algorithms, Prentice Hall, Englewood Cliffs, New Jersey, 1994.
4. J. S. Vitter, Random Sampling with a Reservoir, ACM Trans, on Mathematical Software, 11(1985), pp. 31-35.
5. P. B. Gibbons and Y. Matias and V. Poosala, Fast Incremental Maintenance of Approximate Histograms, Proc. of the 23rd VLDB Conference, 1997, pp. 466-475.
6. Y-Matias and J. S. Vitter and M. Wang, Dynamic Maintenance of Wavelet-Based Histograms, Proc. of the 26th VLDB Conference, 2000, pp. 101-110.