Hash table
Caching and locality of reference

The linked list of separate chaining implementation may not be cache-conscious due to spatial locality — locality of reference —when the nodes of the linked list are scattered across memory, thus the list traversal during insert and search may entail CPU cache inefficiencies.

In cache-conscious variants of collision resolution through separate chaining, a dynamic array found to be more cache-friendly is used in the place where a linked list or self-balancing binary search trees is usually deployed, since the contiguous allocation pattern of the array could be exploited by hardware-cache prefetchers —such as translation lookaside buffer —resulting in reduced access time and memory consumption.
language:response_language[Portuguese], detectable_content:postscript