Re:Advanced techniques to implement fast hash tables
by woadwarrior01 on Wednesday October 24, 2018 @05:21AM
(#18290871)
The split keys and values arrays in Python 3.6 dictionaries make it more compact than dictionaries from earlier versions of Python, which makes it more cache friendly. But Python dictionaries (and sets) use a variant of double hashing for collision resolution, which is less cache friendly than Robin Hood hashing's linear probing. It's certainly possible to combine both techniques to come up with a hybrid dictionary with the best aspects of both split keys and Robin Hood hashing.
[ Parent
| on HN ]
There are no comments on this comment yet.