Sketching asynchronous streams over a sliding window

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 2006, Issue , 2006, Pages 82-91

  Tirthapura, Srikanta ^a   Xu, Bojian ^a   Busch, Costas ^b  

^a IOWA STATE UNIVERSITY   (United States)

^b Rensselaer Polytechnic Institute   (United States)

Author keywords

Aggregates; Asynchronous streams; Data stream processing; Distributed streams; Sketches of streams; Sliding windows; Union of streams

Indexed keywords

AGGREGATES; ALGORITHMS; COMPUTER NETWORKS; PARAMETER ESTIMATION; PROBLEM SOLVING; QUERY LANGUAGES; THEOREM PROVING;

ASYNCHRONOUS STREAMS; DATA STREAM PROCESSING; DISTRIBUTED STREAMS; SLIDING WINDOWS; STREAMS SKETCHES; UNION STREAMS;

DATA STRUCTURES;

EID: 33748712629     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146381.1146397     Document Type: Conference Paper

References (19)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
2. A. Arasu and G. Manku, Approximate counts and quantiles over sliding windows. In Proc. ACM Symposium on Principles of Database Systems (PODS), pages 286-296, 2004.
3. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proc. 21st ACM Symp. on Principles of Database Systems (PODS), pages 1-16, 2002.
4. B. Babcock, M. Datar, R. Motwani, and L. O'Callaghan. Maintaining variance and k-medians over data stream windows. In Proc. 22nd ACM Symp. on Principles of Database Systems (PODS), pages 234-243, June 2003.
5. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. SIAM Journal on Computing, 31(6):1704-1813, 2002.
6. J. Feigenbaum, S. Kannan, and J. Zhang. Computing diameter in the streaming and sliding-window models. Algorithmica, 41:25-41, 2005.
7. P. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In Proc. 27th International Conf. on Very Large Data Bases (VLDB), pages 541-550, 2001.
8. P. Gibbons and S. Tirthapura. Estimating simple functions on the union of data streams. In Proc. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 281-291, 2001,
9. P. Gibbons and S. Tirthapnra. Distributed streams algorithms for sliding windows. Theory of Computing Systems, 37:457-478, 2004.
10. M. Greenwald and S. Khanna. Space efficient online computation of quantile summaries. In Proc. ACM International Conference on Management of Data (SIGMOD), pages 58-66, 2001.
11. S. Guha, D. Gunopulos, and N. Koudas. Correlating synchronous and asynchronons data streams. In Proc. 9th ACM International Conference on Knowledge Discovery and Data Mining (KDD), pages 529-534, 2003.
12. S. Madden, M. Franklin, J. Hellerstein, and W. Hong. Tag: a tiny aggregation service for ad-hoc sensor networks. SIGOPS Operating Systems Review, 36(SI):131-146, 2002.
13. A. Maujhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. Finding (recently) frequent items in distributed data streams. In Proc. IEEE International Conference on Data Engineering (ICDE), pages 767-778, 2005.
14. G. Manku, S. Rajagopalan, and B. Lindsley. Approximate medians and other quantiles in one pass and with limited memory. In Proc. ACM SIGMOD International Conf. on Management of Data, pages 426-435, June 1998.
15. S. Muthukrishnan. Data streams: Algorithms and applications. Technical report, Rutgers University, Piscataway, NJ, 2003.
16. B. Patt-Shamir. A note on efficient aggregate queries in sensor networks. In Proc. of the 23rd annual ACM symposium on Principles of Distributed Computing (PODC), pages 283-289, 2004.
17. 0 over massive data streams. In Proc. IEEE International Conference on Data Engineering (ICDE), 2005.
18. J. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-hoeffding bounds for applications with limited independence. SIAM J. Discrete Math., 8(2):223-250, 1995.
19. U. Srivastava and J. Widom. Flexible time management in data stream systems. In Proc. 23rd ACM Symposium on Principles of Database Systems (PODS), pages 263-274, 2004.