论文信息 - Probabilistic Counting Algorithms for Data Base Applications - 字舞流文

Probabilistic Counting Algorithms for Data Base Applications

Philippe Flajolet | G. Nigel Martin | P. Flajolet | G. Martin

[1] Philippe Flajolet,et al. Approximate counting: A detailed analysis , 1985, BIT.

[2] Philippe Flajolet,et al. Probabilistic counting , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[3] Patricia G. Selinger,et al. Access path selection in a relational database management system , 1979, SIGMOD '79.

[4] Robert H. Morris,et al. Counting large numbers of events in small registers , 1978, CACM.

[5] J. Ian Munro,et al. Sorting and Searching in Multisets , 1976, SIAM J. Comput..

[6] Vincent Y. Lum,et al. Key-to-address transform techniques: a fundamental performance study on large existing formatted files , 1971, CACM.

[7] G. Doetsch. Handbuch der Laplace-Transformation , 1950 .