DMCA
Probabilistic Counting Algorithms for Data Base Applications (1985)
Cached
Download Links
- [algo.inria.fr]
- [www.madalgo.au.dk]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Citations: | 443 - 6 self |
BibTeX
@MISC{Flajolet85probabilisticcounting,
author = {Philippe Flajolet and G. N. Martin and G. Nigel Martin},
title = {Probabilistic Counting Algorithms for Data Base Applications},
year = {1985}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper introduces a class of probabilistic counting lgorithms with which one can estimate the number of distinct elements in a large collection of data (typically a large file stored on disk) in a single pass using only a small additional storage (typically less than a hundred binary words) and only a few operations per element scanned. The algorithms are based on statistical observations made on bits of hashed values of records. They are by con- struction totally insensitive to the replicafive structure of elements in the file; they can be used in the context of distributed systems without any degradation of performances and prove especially useful in the context of data bases query optimisation. ; 1985 Academic Press, Inc
Keyphrases
data base application probabilistic counting algorithm single pas large file statistical observation hashed value probabilistic counting lgorithms hundred binary word distinct element large collection academic press replicafive structure data base small additional storage distributed system con struction
