3 ms·
Isn't this just similar to hash prefixes and not a true bloom filter?
by cma 5y ago
Isn't this just similar to hash prefixes and not a true bloom filter?
- 6510 5y agoI did say I'd butcher it. :-) imho one shouldn't be overly attached to an exact implementation but learn to reason about it. You could for example make an array and count how many times each bit was set. A textbook bloomfilter doesn't allow you to remove things but if you count how often a bit was set you obviously can.