Bloom filter

Bloom filter is a space-efficient probabilistic data structure, telling whether an element is ‘possibly in set’ or ‘definitely not in set’.

To add an element, feed it to each of the k hash functions to get k array positions and set them to 1. To test, tell whether all the hashed slots are 1.

Implementation

In Redission, use com.ys.rediscluster.bloomfilter.redissonto wrap.