Erratum: Corrigendum to “The frequent items problem, under polynomial decay, in the streaming model” (Theoretical Computer Science (2010) 411(34–36) (3048–3054)(S0304397510002343)(10.1016/j.tcs.2010.04.029));The frequent items problem, under polynomial decay, in the streaming model

Theoretical Computer Science

Volumn 411, Issue 34-36, 2010, Pages 3048-3054

  Feigenblat, Guy ^a   Itzhaki, Ofra ^a   Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Algorithms; Frequency count; Polynomial decay functions; Streaming

Indexed keywords

ACOUSTIC STREAMING; ALGORITHMS; DECAY (ORGANIC); EXPONENTIAL FUNCTIONS; POLYNOMIALS; STOCHASTIC SYSTEMS;

DATA STREAM; DECAY FUNCTION; DECAY PARAMETERS; FREQUENCY COUNTS; POLYNOMIAL DECAY; POLYNOMIAL FUNCTIONS; PROBABILITY OF FAILURE; STREAMING MODEL;

STOCHASTIC MODELS;

EID: 77955421441     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2016.09.001     Document Type: Erratum

References (20)

1. E. Cohen, and M.J. Strauss Maintaining time-decaying stream aggregates J. Algorithms 59 1 2006 19 36
2. M.F. Arlitt, and C.L. Williamson Trace-driven simulation of document caching strategies for internet web servers Simulation J. 68 1996 23 33
3. P. Cao, S. Irani, Cost-aware www proxy caching algorithms, in: USENIX '97: Proceedings of the Symposium on Internet Technology and Systems, 1997, pp. 193206.
4. R. Friedrich, M. Arlitt, L. Cherkasova, J. Dilley, R. Friedrich, T. Jin, Evaluating content management techniques for web proxy caches, in: WISP '99: Proceedings of the 2nd Workshop on Internet Server Performance, Atlanta GA, 1999.
5. T. Kopelowitz, and E. Porat Improved algorithms for polynomial-time decay and time-decay with additive error Theoret. Comput. Syst. 42 3 2008 349 365
6. M. Datar, A. Gionis, P. Indyk, and R. Motwani Maintaining stream statistics over sliding windows: (extended abstract) In: SODA '02: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms 2002 Society for Industrial and Applied Mathematics Philadelphia, PA, USA 635 644
7. G. Cormode, S. Tirthapura, and B. Xu Time-decaying sketches for sensor data aggregation PODC '07: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing 2007 ACM New York, NY, USA 215 224
8. G. Cormode, F. Korn, and S. Tirthapura Time-decaying aggregates in out-of-order streams PODS '08: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of Database Systems 2008 ACM New York, NY, USA 89 98
9. S. Muthukrishnan Data streams: algorithms and applications Found. Trends Theor. Comput. Sci. 1 2 2005
10. J. Misra, and D. Gries Finding repeated elements Sci. Comput. Program. 2 2 1982 143 152
11. E.D. Demaine, A. Lpez-Ortiz, and J.I. Munro Frequency estimation of internet packet streams with limited space ESA '02: Proceedings of the 10th Annual European Symposium on Algorithms 2002 Springer-Verlag London, UK 348 360
12. R.M. Karp, S. Shenker, and C.H. Papadimitriou A simple algorithm for finding frequent elements in streams and bags ACM Trans. Database Syst. 28 1 2003 51 55
13. P. Bose, E. Kranakis, P. Morin, Y. Tang, Bounds for frequency estimation of packet streams, in: SIROCCO, 2003, pp. 3342.
14. G.S. Manku, R. Motwani, Approximate frequency counts over data streams, in: VLDB '02: Proceedings of the 28th International Conference on Very Large Data Bases, VLDB Endowment, 2002, pp. 346357.
15. A. Arasu, and G.S. Manku Approximate counts and quantiles over sliding windows PODS '04: Proceedings of the Twenty-Third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems 2004 ACM New York, NY, USA 286 296
16. L. Golab, D. DeHaan, E.D. Demaine, A. Lopez-Ortiz, and J.I. Munro Identifying frequent items in sliding windows over on-line packet streams IMC '03: Proceedings of the 3rd ACM SIGCOMM Conference on Internet Measurement 2003 ACM New York, NY, USA 173 178
17. L. Zhang, and Y. Guan Variance estimation over sliding windows PODS '07: Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems 2007 ACM New York, NY, USA 225 232
18. G. Cormode, and S. Muthukrishnan An improved data stream summary: the count-min sketch and its applications J. Algorithms 55 1 2005 58 75
19. M. Charikar, K. Chen, and M. Farach-Colton Finding frequent items in data streams ICALP '02: Proceedings of the 29th International Colloquium on Automata, Languages and Programming 2002 Springer-Verlag London, UK 693 703
20. M. Charikar, K. Chen, and M. Farach-Colton Finding frequent items in data streams ICALP '02: Proceedings of the 29th International Colloquium on Automata, Languages and Programming 2002 Springer-Verlag London, UK 693 703