NOTE

2.1 Redis BloomFilter

A Redis-based BloomFilter implementation idea using BitMaps and automatic expansion.

Redis / CacheCreated 01/17/2020Updated 03/23/20201 min readhistorical

This is a historical learning note and may contain outdated or incomplete understanding.

1. Redis Implementation

The bit array can be implemented with Redis BitMaps.
Automatic expansion can use a cursor to record the current BitMaps position. After saturation is reached, create another BitMaps of the same size.
Then the get logic becomes checking whether the element exists in any BitMaps.
The put logic also becomes inserting only when the element does not exist in any BitMaps.

JavaScript is required to load comments.Open the discussion on GitHub