Building a High-Performance Rotating Bloom Filter in Java

Posted by udaysagar 4 days ago

Counter44Comment5OpenOriginal

Comments

Comment by drob518 6 hours ago

I’m not sure that problem 3 needs any solution at all, particularly a read-write lock. If a thread is updating the old set of bits when it’s time for a switch, just let it complete that write to the older set in parallel with the swap. Since the read path checks older sets of bits in any case, it really doesn’t matter if the bit is set in the latest bit-set or the older bit-set. Yes, it might age out slightly faster, but it would have done that anyway if the write had arrived a millisecond before the aging timer fired. If that bothers you, keep more old bit sets around and age them out faster.

Comment by FloayYerBoat 6 hours 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.

Comment by madduci 1 hour ago

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.

Comment by accrual 4 hours ago

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.

Comment by StilesCrisis 4 hours ago

This is ChatGPT spew. Don't bother.