4 ms·
Bloom filters are an example of a hashing data structure that does not support delete. So yes, such a tradeoff can be made. Maybe some DHT implementations als
by samcheng 8y ago
Bloom filters are an example of a hashing data structure that does not support delete. So yes, such a tradeoff can be made.
Maybe some DHT implementations also make deletion hard? (In general, I'd much rather mark something as invalid than delete it.)
- kccqzy 8y agoI think GP is talking about improving performance just by omitting deletion support in hash maps. For example the tombstone marking in the original article won't be necessary. Experience tells me that for a host of data structures (vectors, BSTs, hash maps and many others), omitting deletion support can simplify the code a lot as well.
- adamnemecek 8y agoThere’s cuckoo filters.