Range-efficient counting of distinct elements in a massive data stream

SIAM Journal on Computing

Volumn 37, Issue 2, 2007, Pages 359-379

  Pavan, A ^a   Tirthapura, Srikanta ^b  

^a Iowa State University   (United States)

^b Iowa State University of Science and Technology   (United States)

Author keywords

Data streams; Distinct elements; Range efficiency; Reductions; Sensor networks

Indexed keywords

DATA STREAMS; DISTINCT ELEMENTS; RANDOMIZED ALGORITHMS; RANGE EFFICIENCY;

ALGORITHMS; DATABASE SYSTEMS; INTEGER PROGRAMMING; PROBLEM SOLVING; RANDOM PROCESSES; SENSOR NETWORKS;

DATA REDUCTION;

EID: 36849040673     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050643672     Document Type: Article

References (24)

1. M. AJTAI, T. S. JAYRAM. R. KUMAR, AND D. SIVAKUMAR, Approximate counting of inversions in a data stream, in Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2002, pp. 370-379.
2. N. ALON. Y. MATIAS, AND M. SZEGEDY, The space complexity of approximating the frequency moments, J. Comput. System Sci., 58 (1999), pp. 137-147.
3. B. BABCOCK. S. BABU. M. DATAR, R. MOTWANI, AND J. WIDOM, Models and issues in data stream systems, in Proceedings of the 21st ACM Symposium on Principles of Database Systems (PODS), 2002, pp. 1-16.
4. L. S. BURIOL, G. FRAHLING, S. LEONARDI, A. MARCHETTI-SPACCAMELA, AND C. SOHLER, Counting triangles in data streams, in Proceedings of the ACM Symposium on Principles of Database Systems (PODS), 2006, pp. 253-262.
5. Z. BAR-YOSSEF, T. JAYRAM, R. KUMAR, D. SIVAKUMAR, AND L. TREVISAN, Counting distinct elements in a data stream, in Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM), Lecture Notes in Comput. Sci. 2483, Springer, Berlin, 2002, pp. 1-10.
6. Z. BAR-YOSSEF. R. KUMAR, AND D. SIVAKUMAR, Reductions in streaming algorithms, with an application to counting triangles in graphs, in Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 623-632.
7. G. CORMODE. M. DATAR. P. INDYK, AND S. MUTHUKRISHNAN, Comparing data streams using hamming nonns (how to zero in), IEEE Transactions on Knowledge and Data Engineering, 15 (2003), pp. 529-540.
8. A. R. CALDERBANK, A. GILBERT, K. LEVCHENKO, S. MUTHUKRISHNAN, AND M. STRAUSS, Improved range-summable random variable construction algorithms, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.
9. D. COPPERSMITH AND R. KUMAR, An improved data stream algorithm for frequency moments, in Proceedings of the 15th ACM-SlAM Symposium on Discrete Algorithms (SODA), 2004, pp. 151-156.
10. J. CONSIDINE, F. LI, G. KOLLIOS, AND J. BYERS, Approximate aggregation techniques for sensor databases, in Proceedings of the 20th IEEE International Conference on Data Engineering (ICDE), 2004, pp. 449-460.
11. G. CORMODE AND S. MUTHUKRISHNAN, Estimating dominance norms of multiple data streams, in Proceedings of the 11th European Symposium on Algorithms (ESA), Lecture Notes in Comput. Sci. 2832, Springer, Berlin, 2003, pp. 148-160.
12. J. L. CARTER AND M. L. WEGMAN, Universal classes of hash functions, J. Comput. System Sci., 18 (1979), pp. 143-154.
13. M. DATAR, A. GIONIS, P. INDYK, AND R. MOTWANI, Maintaining stream statistics over sliding windows, SIAM J. Comput., 31 (2002), pp. 1794-1813.
14. 1 -difference algorithm for massive data streams, SIAM J. Comput., 32 (2002), pp. 131-151.
15. P. FLAJOLET AND G. N. MARTIN, Probabilistic counting algorithms for database applications, J. Comput. System Sci., 31 (1095), pp. 182-209.
16. A. C. GILBERT, S. GUHA, P. INDYK, Y. KOTIDIS, S. MUTHUKRISHNAN, AND M. STRAUSS, Fast, small-space algorithms for approximate histogram maintenance, in Proceedings of the ACM Symposium on Theory of Computing (STOC), 2002, pp. 389-398.
17. A. C. GILBERT, Y. KOTIDIS, S. MUTHUKRISHNAN, AND M. STRAUSS, One-pass wavelet decompositions of data streams, IEEE Trans. Knowl. Data Eng., 15 (2003), pp. 541-554.
18. O. GOLDREICH, A Sample of Samplers: A Computational Perspective on Sampling (Survey), Technical report TR97-020, Electronic Colloquium on Computational Complexity, 1997.
19. P. B. GIBBONS AND S. TIRTHAPURA, Estimating simple functions on the union of data streams, in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2001, pp. 281-291.
20. P. J. HAAS, J. F. NAUGHTON, S. SESHADRI, AND L. STOKES, Sampling-based estimation of the number of distinct values of an attribute, in Proceedings of the 21st International Conference on Very Large Data Bases, Morgan Kaufmann, San Mateo, CA, 1995, pp. 311-322.
21. P. INDYK AND D. WOODRUFF, Tight lower bounds for the distinct elements problem, in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science (FOCS), 2003, p. 283.
22. H. JOWHARI AND M. GHODSI, New streaming algorithms for counting triangles in graphs, in Proceedings of the International Conference on Computing and Combinatorics (COCOON), Lecture Notes in Comput. Sci. 3595, Springer, Berlin, 2005, pp. 710-716.
23. S. MUTHUKRISHNAN, Data Streams: Algorithms and Applications, Foundations and Trends in Theoretical Computer Science, Now Publishers, 2005.
24. S. NATH, P. B. GIBBONS, S. SESHAN, AND Z. ANDERSON, Synposis diffusion for robust aggregation in sensor networks, in Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems, ACM Press, New York, 2004, pp. 250-262.