Re:In-memory hash tree implementation
by rurban on Sunday March 27, 2016 @02:20PM
(#11370888)
Every not open addressed hash table can use load factors up to 100%, compared to 50-75%.
Robin hood is a special case.
Concurrent leapfrog hashing would save the go lock and performance problems better. No need for trees when you can use a proper concurrent in-memory hash table.
And you can use string keys.
Concurrent leapfrog hashing would save the go lock and performance problems better. No need for trees when you can use a proper concurrent in-memory hash table. And you can use string keys.