3 ms·
It's not really a very equal comparison to compare something that supports dynamic updates and which doesn't. If you're willing to compare arbitrary operating
by nullc 4y ago
It's not really a very equal comparison to compare something that supports dynamic updates and which doesn't.
If you're willing to compare arbitrary operating behavior, a simple entropy coded bitset will achieve the information theoretic bound -- it just isn't updatable or queryable on the fly. :P
- vlovich123 4y agoBut these other filters are dynamically queryable on the fly. I think all these keys also support dynamic additions. What they don’t support (and neither does Bloom afaik) is removal of a key. For the kinds of typical applications for these, it tends to fit well enough.
- vlovich123 4y agoI’m wrong. You need to give the entire set of keys upfront during construction for some of these filters.
- nullc 4y agoYeah, I believe ~all of the ones with greater space efficiency than cuckoo filters (or blocked bloom, depending on the false positive rate) don't have incremental insert.