ACM Home Page
Please provide us with feedback. Feedback
Probabilistic counting algorithms for data base applications
Source Journal of Computer and System Sciences archive
Volume 31 ,  Issue 2  (September 1985) table of contents
Pages: 182 - 209  
Year of Publication: 1985
ISSN:0022-0000
Authors
Philippe Flajolet  INRIA, Rocquencourt, France
G. Nigel Martin  IBM Development Lab., Hursley Park, UK
Publisher
Academic Press, Inc.  Orlando, FL, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 112
Additional Information:

cited by   index terms   review   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1016/0022-0000(85)90041-8

CITED BY  112


REVIEW

"Theodore David Brown : Reviewer"

The algorithm presented here bounds the number of distinct elements (n) in a large collection of data records. The essence of the algorithm is to “or” to a bit vector the least significant one bit of a hashed version of ea  more...

Collaborative Colleagues:
Philippe Flajolet: colleagues
G. Nigel Martin: colleagues