3 ms·
Completely leaving out cache-conscious hashing. And before I would improve the hash function by some extremely costly ML, I would rather find a perfect hash. W
by rurban 9y ago
Completely leaving out cache-conscious hashing.
And before I would improve the hash function by some extremely costly ML, I would rather find a perfect hash. Which is cheap.
But he linked to my SMHasher.
- valera_rozuvan 9y agoSubmitted a PR for your SMHasher repo: https://github.com/rurban/smhasher/pull/41 https://github.com/rurban/smhasher/pull/41 .
- tebba-lebba 9y agoAre you talking about cache utilization in the context of collision handling, or hash functions themselves? I'd love to learn more about cache-conscious hashing, could you suggest a paper to read, or algorithm to search for? I Googled "Cache-Conscious Hashing" but didn't quickly find anything promising :(. Thanks!
- rurban 9y agoThe 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.