Writable@Public @Stable public final class CountingBloomFilter extends Filter
A counting Bloom filter is an improvement to standard a Bloom filter as it allows dynamic additions and deletions of set membership information. This is achieved through the use of a counting vector instead of a bit vector.
Originally created by European Commission One-Lab Project 034819.
hash, hashType, nbHash, vectorSize| Constructor | Description |
|---|---|
CountingBloomFilter() |
Default constructor - use with readFields
|
CountingBloomFilter(int vectorSize,
int nbHash,
int hashType) |
Constructor
|
| Modifier and Type | Method | Description |
|---|---|---|
void |
add(Key key) |
Adds a key to this filter.
|
void |
and(Filter filter) |
Peforms a logical AND between this filter and a specified filter.
|
int |
approximateCount(Key key) |
This method calculates an approximate count of the key, i.e.
|
void |
delete(Key key) |
Removes a specified key from this counting Bloom filter.
|
boolean |
membershipTest(Key key) |
Determines wether a specified key belongs to this filter.
|
void |
not() |
Performs a logical NOT on this filter.
|
void |
or(Filter filter) |
Peforms a logical OR between this filter and a specified filter.
|
void |
readFields(java.io.DataInput in) |
Deserialize the fields of this object from
in. |
java.lang.String |
toString() |
|
void |
write(java.io.DataOutput out) |
Serialize the fields of this object to
out. |
void |
xor(Filter filter) |
Peforms a logical XOR between this filter and a specified filter.
|
public CountingBloomFilter()
public CountingBloomFilter(int vectorSize,
int nbHash,
int hashType)
vectorSize - The vector size of this filter.nbHash - The number of hash function to consider.hashType - type of the hashing function (see
Hash).public void delete(Key key)
Invariant: nothing happens if the specified key does not belong to this counter Bloom filter.
key - The key to remove.public void and(Filter filter)
FilterInvariant: The result is assigned to this filter.
public boolean membershipTest(Key key)
FiltermembershipTest in class Filterkey - The key to test.public int approximateCount(Key key)
key -> count map.
NOTE: due to the bucket size of this filter, inserting the same
key more than 15 times will cause an overflow at all filter positions
associated with this key, and it will significantly increase the error
rate for this and other keys. For this reason the filter can only be
used to store small count values 0 <= N << 15.
key - key to be testedv == count with probability equal to the
error rate of this filter, and v > count otherwise.
Additionally, if the filter experienced an underflow as a result of
delete(Key) operation, the return value may be lower than the
count with the probability of the false negative rate of such
filter.public void not()
FilterThe result is assigned to this filter.
public void or(Filter filter)
FilterInvariant: The result is assigned to this filter.
public void xor(Filter filter)
FilterInvariant: The result is assigned to this filter.
public java.lang.String toString()
toString in class java.lang.Objectpublic void write(java.io.DataOutput out)
throws java.io.IOException
Writableout.public void readFields(java.io.DataInput in)
throws java.io.IOException
Writablein.
For efficiency, implementations should attempt to re-use storage in the existing object where possible.
readFields in interface WritablereadFields in class Filterin - DataInput to deseriablize this object from.java.io.IOException - any other problem for readFields.Copyright © 2008–2025 Apache Software Foundation. All rights reserved.