Re:A new fast hash table in response to Google’s new fast ha...
by stochastic_monk on Tuesday May 29, 2018 @10:47PM
(#17184633)
This is getting deep into some wizardry, but if you used a custom pool-like allocator you could group contents close together in cache, and, if necessary/appropriate, even rearrange the elements in the container to be more cache-friendly for your purposes.
[ Parent
| on HN ]
Re:A new fast hash table in response to Google’s new fast ha...
by thecompilr on Wednesday May 30, 2018 @02:00AM
(#17185425)
You could, but the premise of using a tree was to avoid unpredictable rehashing latency, if you start compacting the tree every now and then, you basically pay the same price.
Re:A new fast hash table in response to Google’s new fast ha...
by MaxBarraclough on Wednesday May 30, 2018 @07:12AM
(#17186700)
That approach tastes rather like a copying+compacting garbage-collector.