You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The fixed key sized hash table consumes the same amount RSS as unordered_map while variant key sized hash table doubles the memory consumption. Both hash tables are 3 times slower than unordered_map when doing insertion.
Is that a fair benchmark? What benefits can I get for using opic hash tables in memory only?
Does it make sense to support non-disk backed hash tables?
The text was updated successfully, but these errors were encountered: