Hash table - Wikipedia, the free encyclopedia
Some chaining implementations store the first record of each chain in the slot array itself. The number of pointer traversals is decreased by one for most cases. The purpose is to increase cache efficiency of hash table access. The disadvantage is that an...