2 ms·

My understanding is that Robin Hood hashing has worse performance than linear probing due to greater cache misses. If you are looking for low memory overhead o

by detrino 11y ago

My understanding is that Robin Hood hashing has worse performance than linear probing due to greater cache misses. If you are looking for low memory overhead ordered sets/maps, then B-Trees can provide that.

eutectic 11y ago
Why would it give greater cache mosses? My understanding is that it requires fewer because it reduces the average probe distance and obviates the need for tombstones and the attendant performance degradation.
- detrino 11y ago
  Sorry, it's early, I was thinking about cuckoo hashing.