Probabilistic data structures in Redis
HyperLogLog is a probabilistic data structure that estimates the cardinality of a set.
Bloom filters are a probabilistic data structure that checks for presence of an element in a set
Cuckoo filters are a probabilistic data structure that checks for presence of an element in a set
t-digest is a probabilistic data structure that allows you to estimate the percentile of a data stream.
Top-K is a probabilistic data structure that allows you to find the most frequent items in a data stream.
Count-min sketch is a probabilistic data structure that estimates the frequency of an element in a data stream.
RedisBloom supports multiple module configuration parameters. All of these parameters can only be set at load-time.