The space complexity of approximating the frequency moments

Journal of Computer and System Sciences

Volumn 58, Issue 1, 1999, Pages 137-147

  Alon, Noga ^a,b   Matias, Yossi ^a   Szegedy, Mario ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; RANDOM PROCESSES;

FREQUENCY MOMENTS;

SET THEORY;

EID: 0033077324     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1545     Document Type: Article

References (21)

1. N. Alon, L. Babai, and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms 7 (1986), 567-583.
2. N. Alon, P. Gibbons, Y. Matias, and M. Szegedy, Dynamic probabilistic maintenance of self-join sizes in limited storage, manuscript, Feb. 1996.
3. N. Alon and J. H. Spencer, "The Probabilistic Method," Wiley, New York, 1992.
4. L. Babai, P. Frankl, and J. Simon, Complexity classes in communication complexity theory, in "Proceedings, 27th IEEE FOCS, 1986," pp. 337-347.
5. T. M. Cover and J. A. Thomas, "Elements of Information Theory," Wiley, New York, 1991.
6. D. J. DeWitt, J. F. Naughton, D. A. Schneider, and S. Seshadri, Practical skew handling in parallel joins, in "Proc. 18th Int'l. Conf. on Very Large Data Bases, 1992," p. 27.
7. P. Flajolet, Approximate counting: a detailed analysis, BIT 25 (1985), 113-134.
8. P. Flajolet and G. N. Martin, Probabilistic counting, in "FOCS 1983," pp. 76-82.
9. P. Gibbons, Y. Matias, and A. Witkowski, Practical maintenance algorithms for high-biased histograms using probabilistic filtering, technical report, AT&T Bell Laboratories, Murray Hill, NJ, Dec. 1995.
10. A. Gupta and I. S. Mumick, Maintenance of materialized view: Problems, techniques, and applications, IEEE Data Eng. Bull. Special Issue on Materialized Views and Data Warehousing 18(2) (1995).
11. I.J. Good, Surprise indexes and P-values, J. Statist. Comput. Simul. 32 (1989), 90-92.
12. M. Hofri and N. Kechris, Probabilistic counting of a large number of events, manuscript, 1995.
13. P. J. Haas, J. F. Naughton, S. Seshadri, and L. Stokes, Sampling-based estimation of the number of distinct values of an attribute, in "Proc. of the 21st VLDB Conference, 1995," pp. 311-322.
14. Y. E. Ioannidis and V. Poosala, Balancing Histogram Optimality and Practicality for Query Result Size Estimation, in "Proc. ACM-SIGMOD, 1995."
15. B. Kalyanasundaram and G. Schnitger, The probabilistic communication complexity of set intersection, 2nd, in "Structure in Complexity Theory Conference, 1987," pp. 41-49.
16. Y. Ling and W. Sun, A supplement to sampling-based methods for query size estimation in a database system, SIGMOD Record 21(4) (1992), 12-15.
17. R. Morris, Counting large numbers of events in small registers, Comm. ACM 21 (1978), 840-842.
18. A. A. Razborov, On the distributional complexity of disjointness, in "Proc. of the ICALP, 1990," pp. 249-253, Theoretical Comput. Sci., to appear.
19. K.-Y. Whang, B. T. Vander-Zanden, and H. M. Taylor, A linear-time probabilistic counting algorithm for database applications, ACM Transactions on Database Systems 15(2) (1990), 208-229.
20. A. C. Yao, Some complexity questions related to distributed computing, in "Proc. of the 11th ACM STOC, 1979," pp. 209-213.
21. A. C. Yao, Lower bound by probabilistic arguments, in "Proc. of the 24th IEEE FOCS, 1983," pp. 420-428.