Re:Building a faster hash table for high performance SQL joins
by puzpuzpuz-hn on Thursday December 21, 2023 @03:05AM
(#38718106)
Hi, if you're asking about the hash table itself, then currently we use linear probing, i.e. k/v pairs with a collision are inserted sequentially starting with the hash%capacity index.
[ Parent
| on HN ]
There are no comments on this comment yet.