Probabilistic Data Structures with Redis Bloom
summary
RedisBloom adds a scalable Bloom filter, cuckoo filter, count‑min sketch and top‑k to Redis and demonstrates real commands and configs: use BF.ADD / BF.RESERVE to create a Bloom with BF.RESERVE 0.001 capacity 100000000 for ~0.1% false positives, use CF.RESERVE / CF.ADD for deletable membership, use CMS.INITBYPROB / CMS.INCRBY for frequency estimates, and TOPK.RESERVE to maintain the top K items — all measured tradeoffs between memory, speed and configurable error.
AI-written summary · about
chapters (12)
- 0:00Introduction to counting problems
- 10:08Overview of Redis
- 13:22Redis Bloom module
- 17:56Bloom filter demo
- 24:02Cuckoo filter explanation
- 25:29Cuckoo filter demo
- 29:11Top K implementation
- 30:35Top K demo
- 36:15Count-min sketch basics
- 38:22Count-min sketch demo
- 42:15How count-min sketch works
- 50:06Conclusion and resources
related talks
28mBloom filters with redis
48mProbabilistic data structures
26mNo, Maybe and Close Enough! Probabilistic Data Structures with Python and Redis
37mWhen Probably is Good Enough
01h 00mCount-min Sketch to Infinity
47mUnderstanding Probabilistic Data Structures with 112,092 UFO Sightings
41mProbabilistic Data Structures
52mUnderstanding Probabilistic Data Structures with 112,092 UFO Sightings