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.
If you are looking for low memory overhead ordered sets/maps, then B-Trees can provide that.