| Class | Description |
|---|---|
| BloomFilter |
A Bloom filter is a space-efficient probabilistic data structure that offers an approximate
containment test with one-sided error: if it claims that an item is contained in it, this
might be in error, but if it claims that an item is not contained in it, then this is
definitely true.
|
| CountMinSketch |
A Count-min sketch is a probabilistic data structure used for cardinality estimation using
sub-linear space.
|
| Enum | Description |
|---|---|
| BloomFilter.Version | |
| CountMinSketch.Version |
| Exception | Description |
|---|---|
| IncompatibleMergeException |