tailieunhanh - Data Streams Models and Algorithms- P7

Data Streams Models and Algorithms- P7: In recent years, the progress in hardware technology has made it possible for organizations to store and record large streams of transactional data. Such data sets which continuously and rapidly grow over time are referred to as data streams. In addition, the development of sensor technology has resulted in the possibility of monitoring many events in real time. | The Sliding-Window Computation Model and Results 167 10 J. Feigenbaum S. Kannan M. Strauss and M. Viswanathan. An approximate 11 -difference algorithm for massive data streams. In Proc of the 1999 Annual IEEE Symp. on Foundations of Computer Science pages 501-511 1999. 11 A. Gilbert S. Guha P. Indyk Y. Kotidis S. Muthukrishnan and M. Strauss. Fast small-space algorithms for approximate histogram maintenance. In Proc of the 2002 Annual ACM Symp. on Theory of Computing 2002. 12 A. Gilbert Y. Kotidis S. Muthukrishnan and M. Strauss. Surfing wavelets on streams One-pass summaries for approximate aggregate queries. In Proc of the 2001 Inti. Conf on Very Large Data Bases pages 79-88 2001. 13 M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. In Proc of the 2001 ACM SIGMOD Inti. Conf on Management of Data pages 58-66 2001. 14 S. Guha N. Mishra R. Motwani and L. O Callaghan. Clustering data streams. In Proc of the 2000 Annual IEEE Symp. on Foundations of Computer Science pages 359-366 November 2000. 15 P. Indyk. Stable distributions pseudorandom generators embeddings and data stream computation. In Proc of the 2000 Annual IEEE Symp. on Foundations of Computer Science pages 189-197 2000. 16 J. Kang J. F. Naughton and S. Vigías. Evaluating window joins over unbounded streams. In Proc of the 2003 Inti. Conf on Data Engineering March 2003. 17 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 Proc of the 2004 Inti. Conf on Data Engineering March 2004. 18 R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press 1995. 19 IS. Vitter. Random sampling with a reservoir. ACM Trans on Mathematical Software 11 1 37 57 1985. lease purchase PDF Split-Merge on to remove this watermark. Chapter 9 A SURVEY OF SYNOPSIS CONSTRUCTION IN DATA STREAMS Chain C. Aggarwal IBM T. J. Watson Research Center Hawthorne NY 10532 charu@ Philip S.