Distributed streams algorithms for sliding windows

Theory of Computing Systems

Volumn 37, Issue 3, 2004, Pages 457-478

  Gibbons, Phillip B ^a   Tirthapura, Srikanta ^b  

^a INTEL CORPORATION   (United States)

^b Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED STREAMS ALGORITHMS; LOGARITHMIC MEMORY; SLIDING WINDOWS; WORKSPACE MEMORY;

APPROXIMATION THEORY; DATA STRUCTURES; ERROR ANALYSIS; POLYNOMIALS; PROBLEM SOLVING; STATISTICAL METHODS; TELECOMMUNICATION NETWORKS;

ALGORITHMS;

EID: 7444250281     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1156-4     Document Type: Article

References (31)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58:137-147, 1999.
2. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proc. 21st ACM Sigmod-Sigact-Sigart Symp. on Principles of Database Systems (PODS), pages 1-16, June 2002.
3. B. Babcock, M. Datar, and R. Motwani. Sampling from a moving window over streaming data. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 633-634, Jan. 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 Sigmod-Sigact-Sigarch Symp. on Principles of Database Systems (PODS), pages 234-243, June 2003.
5. Z. Bar-Yossef, T. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In Proc. 6th International Workshop on Randomization and Approximation Techniques (RANDOM), pages 1-10. Lecture Notes in Computer Science, vol. 2483. Springer-Verlag, Berlin, Sept. 2002.
6. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 623-632, Jan. 2002.
7. E. Cohen and M. Strauss. Maintaining time-decaying stream aggregates. In Proc. 22nd ACM Sigmod-Sigact-Sigarch Symp. on Principles of Database Systems (PODS), pages 223-233, June 2003.
8. G. Cormode, M. Datar, P. Indyk, and S. Muthukrishnan. Comparing data streams using hamming norms (how to zero in). In Proc. 28th International Conf. on Very Large Data Bases (VLDB), pages 335-345, Aug. 2002.
9. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. SIAM Journal on Computing, 31(6):1794-1813, 2002.
10. J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. Testing and spot-checking of data streams. Technical report, AT&T Shannon Laboratories, Florham Park, NJ, July 1999.
11. 1-difference algorithm for massive data streams. SIAM Journal on Computing, 32(1):131-151, 2002.
12. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31:182-209, 1985.
13. p-difference algorithm for massive data streams. In Proc. 17th Symp. on Theoretical Aspects of Computer Science, pages 193-204. Lecture Notes in Computer Science, vol. 1770. Springer-Verlag, Berlin, Feb. 2000.
14. V. Ganti, J. Gehrke, and R. Ramakrishnan. Demon: mining and monitoring evolving data IEEE Transactions on Knowledge and Data Engineering, 13(1):50-63, Jan.-Feb. 2001.
15. J. Gehrke, F. Korn, and D. Srivastava. On computing correlated aggregates over continual data streams. In Proc. ACM SIGMOD International Conf. on Management of Data (SIGMOD), pages 13-24, May 2001.
16. P. B. 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, Sept. 2001.
17. P. B. Gibbons and Y. Matias. Synopsis data structures for massive data sets. In J. M. Abello and J. S. Vitter, editors, External Memory Algorithms, pages 39-70. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 50. American Mathematical Society, Providence, RI, 1999. Also, a two-page summary of this paper appeared in Proc. SODA '99.
18. P. B. 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, June 2001.
19. P. B. Gibbons and S. Tirthapura. Distributed streams algorithms for sliding windows. In Proc. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 63-72, Aug. 2002.
20. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss. Surfing wavelets on streams: one-pass summaries for approximate aggregate queries. In Proc. 27th International Conf. on Very Large Data Bases (VLDB), pages 79-88, Sept. 2001.
21. S. Guha, N. Koudas, and K. Shim. Data-streams and histograms. In Proc. 33rd ACM Symposium on Theory of Computing (STOC), pages 471-475, July 2001.
22. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. In Proc. 41st IEEE Symp. on Foundations of Computer Science (FOCS), pages 359-366, Nov. 2000.
23. M. R. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. Technical report. Digital Systems Research Center, Palo Alto, CA, May 1998.
24. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In Proc. 41st IEEE Symp. on Foundations of Computer Science (FOCS), Nov. 2000.
25. P. Indyk. Personal communication, 2002.
26. I. Kremer, N. Nisan, and D. Ron. On randomized one-round commmunication complexity. Computational Complexity, 8(1):21-49, 1999.
27. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, Cambridge, 1997.
28. S. Muthukrishnan. Data streams: algorithms and applications. Technical report, Rutgers University, Piscataway, NJ, 2003.
29. I. Newman. Private vs. common random bits in communication complexity. Information Processing Letters, 39:67-71, 1991.
30. I. Newman and M. Szegedy. Public vs. private coin flips in one round communication games. In Proc. 28th ACM Symp. on the Theory of Computing (STOC), pages 561-570, May 1996.
31. L. Trevisan. A note on counting distinct elements in the streaming model. Unpublished manuscript. April 2001.