3 ms·
The hash function itself is mostly cache independent, unless you count those variants which skip long strings. You can cache the hash in the entry itself or no
by rurban 9y ago
The hash function itself is mostly cache independent, unless you count those variants which skip long strings.
You can cache the hash in the entry itself or not. You can compress the entries, but mostly using linear collision structures.
Best paper "Cache-Conscious Collision Resolution in String Hash Tables”, Askitis 2005.