Counting Bloom filter
A Counting Bloom filter is a generalized data structure of Bloom filter, that is used to test whether a count number of a given element is smaller than a given threshold when a sequence of elements is given. As a generalized form of Bloom filter, false positive matches are possible, but false negatives are not – in other words, a query returns either "possibly bigger or equal than the threshold" or "definitely smaller than the threshold".
Link from a Wikipage to another Wikipage
primaryTopic
Counting Bloom filter
A Counting Bloom filter is a generalized data structure of Bloom filter, that is used to test whether a count number of a given element is smaller than a given threshold when a sequence of elements is given. As a generalized form of Bloom filter, false positive matches are possible, but false negatives are not – in other words, a query returns either "possibly bigger or equal than the threshold" or "definitely smaller than the threshold".
has abstract
A Counting Bloom filter is a g ...... y smaller than the threshold".
@en
Link from a Wikipage to an external page
Wikipage page ID
61,292,787
page length (characters) of wiki page
Wikipage revision ID
1,009,845,236
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
A Counting Bloom filter is a g ...... y smaller than the threshold".
@en
label
Counting Bloom filter
@en