'Why Double Hashing has bad cache performance?
The Wikipedia article on Open Addressing says:
linear probing has the best cache performance but is most sensitive to clustering, while double hashing has poor cache performance but exhibits virtually no clustering; quadratic probing falls in-between in both areas
From what I understand, chaining isn't cache friendly and its due to the fact that chaining uses linked lists, which themselves aren't good with caches. Linear Probing on the other hand uses closed hashing and works better with caches.
But why does double hashing have bad cache performance, there are no linked lists involved and its still closed hashing ?
My understanding of the topic is limited, what am I overlooking ?
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|