A general method for estimating correlated aggregates over a data stream

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2012, Pages 162-173

  Tirthapura, Srikanta ^a   Woodruff, David P ^b  

^a Iowa State University   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATE QUERIES; DATA ITEMS; DATA SETS; DATA STREAM; GENERAL METHOD; LARGE DATASETS; LINEAR SPACE ALGORITHMS; LINEAR STORAGE SCHEMES; LOWER BOUNDS; MEMORY REQUIREMENTS; NUMERICAL ATTRIBUTES; PROCESSING TIME; QUERY TIME; SPACE ALGORITHMS; STREAMING ALGORITHM; SUB-STREAMS; SYMMETRIC DIFFERENCE;

ENGINEERING; INDUSTRIAL ENGINEERING;

ALGORITHMS;

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

References (28)

1. N. Alon, Y. Matias, and M. Szegedy, "The space complexity of approximating the frequency moments," Journal of Computer and System Sciences, vol. 58, no. 1, pp. 137-147, 1999.
2. M. Greenwald and S. Khanna, "Space efficient online computation of quantile summaries," in Proc. ACM International Conference on Management of Data (SIGMOD), 2001, pp. 58-66.
3. L. Lee and H. Ting, "A simpler and more efficient deterministic scheme for finding frequent items over sliding windows," in Proceedings of ACM Principles of Database Systems, 2006, pp. 290-297.
4. D. M. Kane, J. Nelson, and D. P. Woodruff, "An optimal algorithm for the distinct elements problem," in PODS, 2010, pp. 41-52.
5. IBM, "System s - stream computing at ibm research," IBM White Paper.
6. C. Systems, "Cisco ios netflow," http://www.cisco.com/web/go/ netflow.
7. N. Shrivastava, C. Buragohain, D. Agrawal, and S. Suri, "Medians and beyond: new aggregation techniques for sensor networks," in SenSys, 2004.
8. A. Andoni, R. Krauthgamer, and K. Onak, "Streaming algorithms from precision sampling," in Foundations of Computer Science (FOCS), 2011.
9. C. Busch and S. Tirthapura, "A deterministic algorithm for summarizing asynchronous streams over a sliding window," in STACS, 2007.
10. P. Indyk and D. P. Woodruff, "Optimal approximations of the frequency moments of data streams," in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), 2005, pp. 202-208.
11. M. Datar, A. Gionis, P. Indyk, and R. Motwani, "Maintaining stream statistics over sliding windows," SIAM Journal on Computing, vol. 31, no. 6, pp. 1794-1813, 2002.
12. B. Xu, S. Tirthapura, and C. Busch, "Sketching asynchronous data streams over sliding windows," Distributed Computing, vol. 20, no. 5, pp. 359-374, 2008.
13. D. Chatziantoniou, M. O. Akinde, T. Johnson, and S. Kim, "The mdjoin: An operator for complex olap," in ICDE, 2001, pp. 524-533.
14. D. Chatziantoniou and K. A. Ross, "Querying multiple features of groups in relational databases," in VLDB, 1996.
15. D. Chatziantoniou, "Ad hoc olap: Expression and evaluation," in ICDE, 1999, p. 250.
16. J. Gehrke, F. Korn, and D. Srivastava, "On computing correlated aggregates over continual data streams," in SIGMOD, 2001.
17. R. Ananthakrishna, A. Das, J. Gehrke, F. Korn, S. Muthukrishnan, and D. Srivastava, "Efficient approximation of correlated sums on data streams," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 3, pp. 569-572, 2003.
18. G. Cormode, F. Korn, and S. Tirthapura, "Time-decaying aggregates in out-of-order streams," in ICDE, 2008.
19. H.-L. Chan, T. W. Lam, L.-K. Lee, and H.-F. Ting, "Approximating frequent items in asynchronous data stream over a sliding window," in Workshop on Approximation and Online Algorithms (WAOA), 2009, pp. 49-61.
20. V. Braverman and R. Ostrovsky, "Effective computations on sliding windows," SIAM Journal on Computing., vol. 39, no. 6, pp. 2113-2131, 2010.
21. P. Gibbons and S. Tirthapura, "Distributed streams algorithms for sliding windows," in SPAA, 2002.
22. M. Thorup and Y. Zhang, "Tabulation based 4-universal hashing with applications to second moment estimation," in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 615-624.
23. 2-heavyhitters on sliding windows," CoRR, vol. abs/1012.3130, 2010.
24. M. Charikar, K. Chen, and M. Farach-Colton, "Finding frequent items in data streams," Theor. Comput. Sci., vol. 312, no. 1, pp. 3-15, 2004.
25. P. Gibbons and S. Tirthapura, "Distributed streams algorithms for sliding windows," Theory of Computing Systems, vol. 37, pp. 457-478, 2004.
26. P. Flajolet and G. N. Martin, "Probabilistic counting algorithms for data base applications," Journal of Computer and System Sciences, vol. 31, pp. 182-209, 1985.
27. S. Muthukrishnan, Data Streams: Algorithms and Applications, ser. Foundations and Trends in Theoretical Computer Science. Now Publishers, August 2005.
28. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson, "On data structures and asymmetric communication complexity," J. Comput. Syst. Sci., vol. 57, no. 1, pp. 37-49, 1998.