Re:A new fast hash table in response to Google’s new fast ha...
by stochastic_monk on Tuesday May 29, 2018 @10:44PM
(#17184622)
Additionally, a hash table could be implemented in such a way that it could be updated during resizing. As long as you set up locks in the right places, you could spend the extra memory to do an out-of-place rehash and allow both concurrent writers and your rehashing thread to write to the new table. It's doable, if difficult and error-prone.
[ Parent
| on HN ]
There are no comments on this comment yet.