Hacker News new | ask | show | jobs
by FloayYerBoat 139 days ago
Looks like an interesting article, with complex problems and solutions. My problem is I have no idea what a "rotating bloom filter" would be used for in a real-world system.
3 comments

It's a probabilistic cache. Standard Bloom filters can't add items indefinitely, and also can't evict old items to make room for new ones. Thus, rotating.

They should've just used a cuckoo filter.

I also would like to know a use case, I know about bloom filters but not what makes a rotating one special. It sounds interesting but I wish the article lead with the purpose of the filter.
It can be used for pseudo randomisation of data and a way to produce same values, given the same inputs, more close to what hashes with salt do.