Oh, cool idea. I had not heard the term Semantic Hashing before, but I'm going to do some research now.

Thanks for sharing!

Are 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!

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.