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.
But he linked to my SMHasher.
I Googled "Cache-Conscious Hashing" but didn't quickly find anything promising :(.
Thanks!
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.