Loglog counting of large cardinalities (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2832, Issue , 2003, Pages 605-617

  Durand, Marianne ^a   Flajolet, Philippe ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUXILIARY MEMORY; CARDINALITIES; DISTINCT ELEMENTS; REAL LIFE DATA; SHAKESPEARE; SINGLE PASS;

ALGORITHMS;

EID: 0142152716     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_55     Document Type: Article

References (16)

1. ALON, N., MATIAS, Y., AND SZEGEDY, M. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences 58 (1999), 137-147.
2. ESTAN, C., AND VARGHESE, G. New directions in traffic measurement and accounting. In Proceedings of SIGCOMM 2002 (2002), ACM Press. (Also: UCSD technical report CS2002-0699, February, 2002; available electronically.).
3. ESTAN, C., VARGHESE, G., AND FISK, M. Bitmap algorithms for counting active flows on high speed links. Technical Report CS2003-0738, UCSD, Mar. 2003.
4. FLAJOLET, P. Approximate counting: A detailed analysis. BIT 25 (1985), 113-134.
5. FLAJOLET, P. On adaptive sampling. Computing 34 (1990), 391-400.
6. FLAJOLET, P., GOURDON, X., AND DUMAS, P. Mellin transforms and asymptotics: Harmonic sums. Theoretical Computer Science 144, 1-2 (1995), 3-58.
7. FLAJOLET, P., AND MARTIN, G. N. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences 31, 2 (1985), 182-209.
8. GIBBONS, P. B., POOSALA, V., ACHARYA, S., BARTAL, Y., MATIAS, Y., MUTHUKRISHNAN, S., RAMASWAMY, S., AND SUEL, T. AQUA: System and techniques for approximate query answering. Tech. report, Bell Laboratories, Murray Hill, New Jersey, Feb. 1998.
9. JACQUET, P., AND SZPANKOWSKI, W. Analytical depoissonization and its applications. Theoretical Computer Science 201, 1-2 (1998).
10. KNUTH, D. E. The Art of Computer Programming, 2nd ed., vol. 3: Sorting and Searching. Addison-Wesley, 1998.
11. MORRIS, R. Counting large numbers of events in small registers. Communications of the ACM 21 (1978), 840-842.
12. MOTWANI, R., AND RAGHAVAN, P. Randomized Algorithms. Cambridge University Press, 1995.
13. C. R. Palmer, G. Siganos, M. Faloutsos, C. Faloutsos, and P. Gibbons. The connectivity and fault-tolerance of the Internet topology. In Workshop on Network-Related Data Management (NRDM-2001).
14. PRODINGER, H. Combinatorics of geometrically distributed random variables: Leftto-right maxima. Discrete Mathematics 153 (1996), 253-270.
15. SZPANKOWSKI, W. Average-Case Analysis of Algorithms on Sequences. John Wiley, New York, 2001.
16. WHANG, K.-Y., ZANDEN, B. T. V., AND TAYLOR, H. M. A linear-time probabilistic counting algorithm for database applications. TODS 15, 2 (1990), 208-229.