Forward decay: A practical time decay model for streaming systems

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 138-149

  Cormode, Graham ^a   Shkapenyuk, Vladislav ^a   Srivastava, Divesh ^a   Xu, Bojian ^b  

^a AT AND T LABS RESEARCH   (United States)

^b IOWA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAMING; DECAY FUNCTION; EFFICIENT ALGORITHM; EMPIRICAL EVIDENCE; EXPONENTIAL DECAYS; EXPONENTIAL TIME; FIXED POINTS; NEW CLASS; POLYNOMIAL DECAY; PRACTICAL MODEL; PRODUCTION DATA; SCALABLE IMPLEMENTATION; TEMPORAL DATA; TIME DECAY;

DATA REDUCTION; DATA WAREHOUSES; QUERY LANGUAGES;

DECAY (ORGANIC);

EID: 67649657688     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.65     Document Type: Conference Paper

References (38)

1. D. Abadi, Y. Ahmad, M. Balazinska, U. Cetintemel, M. Cherniack, J. Hwang, W. Lindner, A. Rasin, N. Tatbul, Y. Xing, and S. Zdonik. Distributed operation in the borealis stream processing engine. In SIGMOD, 2005.
2. C. C. Aggarwal. On biased reservoir sampling in the presence of stream evolution. In VLDB, 2006.
3. N. Alon, N. Duffield, C. Lund, and M. Thorup. Estimating sums of arbitrary selections with few probes. In PODS, 2005.
4. A. Arasu and G. S. Manku. Approximate counts and quantiles over sliding windows. In PODS, 2004.
5. B. Babcock, M. Datar, and R. Motwani. Sampling from a moving window over streaming data. In SODA, 2002.
6. C. Busch and S. Tirthapura. A deterministic algorithm for summarizing asynchronous streams over a sliding window. In STACS, 2007.
7. D. Carney, U. Çetintemel, M. Cherniack, C. Convey, S. Lee, G. Seidman, M. Stonebraker, N. Tatbul, and S. Zdonik. Monitoring streams: a new class of data management applications. In VLDB, 2002.
8. S. Chandrasekaran, O. Cooper, A. Deshpande, M. J. Franklin, J. M. Hellerstein, W. Hong, S. Krishnamurthy, S. R. Madden, F. Reiss, and M. A. Shah. TelegraphCQ: continuous dataflow processing. In SIGMOD, 2003.
9. E. Cohen and M. Strauss. Maintaining time-decaying stream aggregates. In PODS, 2003.
10. G. Cormode, F. Korn, S. Muthukrishnan, T. Johnson, O. Spatscheck, and D. Srivastava. Holistic UDAFs at streaming speeds. In SIGMOD, 2004.
11. G. Cormode, F. Korn, and S. Tirthapura. Exponentially decayed aggregates on data streams. In ICDE, 2008.
12. G. Cormode, F. Korn, and S. Tirthapura. Time decaying aggregates in out-of-order streams. In PODS, 2008.
13. G. Cormode and S. Muthukrishnan. Estimating dominance norms of multiple data streams. In ESA, 2003.
14. G. Cormode, S. Tirthapura, and B. Xu. Time-decaying sketches for sensor data aggregation. In PODC, 2007.
15. C. Cranor, L. Gao, T. Johnson, and O. Spatscheck. Gigascope: High performance network monitoring with an SQL interface. In SIGMOD, 2002.
16. C. Cranor, T. Johnson, O. Spatscheck, and V. Shkapenyuk. Gigascope: A stream database for network applications. In SIGMOD, 2003.
17. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. In SODA, 2002.
18. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI, 2004.
19. P. S. Efraimidis and P. G. Spirakis. Weighted random sampling with a reservoir. Information Processing Letters (IPL), 97:181-185, 2006.
20. P. Gibbons and S. Tirthapura. Distributed streams algorithms for sliding windows. In SPAA, 2002.
21. L. Golab. Sliding Window Query Processing over Data Streams. PhD thesis, University of Waterloo, 2006.
22. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. In FOCS, 2000.
23. Hadoop. http://hadoop.apache.org/.
24. P. Indyk. Better algorithms for high-dimensional proximity problems via asymmetric embeddings. In SODA, 2003.
25. T. Johnson, S. Muthukrishnan, V. Shkapenyuk, and O. Spatscheck. A heartbeat mechanism and its application in gigascope. In VLDB, 2005.
26. L. Lee and H. Ting. A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. In PODS, 2006.
27. J. Li, D. Maier, K. Tufte, V. Papadimos, and P. A. Tucker. No pane, no gain: efficient evaluation of sliding-window aggregates over data streams. SIGMOD Record, 34(1):39-44, 2005.
28. A. Manjhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. Finding (recently) frequent items in distributed data streams. In ICDE, pages 767-778, 2005.
29. A. Metwally, D. Agrawal, and A. E. Abbadi. Efficient computation of frequent and top-k elements in data streams. In ICDT, 2005.
30. F. Olken. Random Sampling from Databases. PhD thesis, Berkeley, 1997.
31. A. Pavan and S. Tirthapura. Range-efficient counting of distinct elements in a massive data stream. SIAM J. on Computing, 37(2):359-379, 2007.
32. R. Pike, S. Dorward, R. Griesemer, and S. Quinlan. Interpreting the data: Parallel analysis with sawzall. Dynamic Grids and Worldwide Computing, 13(4):277-298, 2005.
33. N. Shrivastava, C. Buragohain, D. Agrawal, and S. Suri. Medians and beyond: New aggregation techniques for sensor networks. In ACM SenSys, 2004.
34. Streambase. http://www.streambase.com/.
35. Stanford stream data manager. http://www-db.stanford.edu/stream/sqr.
36. P. A. Tucker, D. Maier, T. Sheard, and L. Fegaras. Exploiting punctuation semantics in countinuous data streams. IEEE Transactions on Knowledge and Data Engineering, 15(3):555-568, May 2003.
37. J. S. Vitter. Random sampling with a reservoir. ACM Transactions on Mathematical Software, 11(1):37-57, Mar. 1985.
38. S. Zdonik, M. Stonebraker, M. Cherniack, and U. Cetintemel. The Aurora and Medusa projects. Bulletin of the Technical Committee on Data Engineering, pages 3-10, Mar. 2003.