System and method using hash table with a set of frequently-accessed buckets and a set of less frequently-accessed buckets

A computing device, comprising:

• a memory including a hash table:
• one or more processors configured to:
• perform a first hash operation on a first key, wherein the first hash operation is biased to map the first key and an associated value to a first candidate bucket within a first set of buckets of the hash table serving as a set of frequently-accessed buckets;
• store an entry for the first key and associated value in the first candidate bucket within the first set of buckets of the hash table;
• perform a second hash operation on a second key, wherein the second hash operation is biased to map the second key and an associated value to a second candidate bucket within a second set of buckets of the hash table serving as a set of less frequently-accessed buckets, wherein the first and second hash operations are performed on a weighted basis in response to table entry insertion requests;
• store an entry for the second key and associated value in the second candidate bucket within the second set of buckets of the hash table;
• in response to a lookup request for a key, perform a first hash table look up of the requested key in the first set of buckets of the hash table;
• in response to the requested key not being found, perform a second hash table lookup of the requested key in the second set of buckets of the hash table;
• and
• move at least one entry between buckets based on tracking data wherein the tracking data represents a number of times each slot in the first set of buckets of the hash table serving as the set of frequently-accessed buckets and a number of times each slot in the second set of buckets of the hash table serving as the set of less frequently-accessed buckets have been accessed.

A non-transitory storage medium comprising executable instructions that when executed by one or more processors, causes the one or more processors to:

• perform a first hash operation on a first key, wherein the first hash operation is biased to map the first key and an associated value to a first candidate bucket within a first set of buckets of a hash table serving as a set of frequently-accessed buckets;
• store an entry for the first key and associated value in the first candidate bucket within the first set of buckets of the hash table;
• perform a second hash operation on a second key, wherein the second hash operation is biased to map the second key and an associated value to a second candidate bucket within a second set of buckets of the hash table serving as a set of less frequently-accessed buckets, wherein the first and second hash operations are performed on a weighted basis in response to table entry insertion requests;
• store an entry for the second key and associated value in the second candidate bucket within the second set of buckets of the hash table;
• in response to a lookup request for a key, perform a first hash table look up of the requested key in the first set of buckets;
• in response to the requested key not being found, perform a second hash table lookup of the requested key in the second set of buckets of the hash table;
• and
• move at least one entry between buckets based on tracking data wherein the tracking data represents a number of times each slot in the first set of buckets of the hash table serving as the set of frequently-accessed buckets and a number of times each slot in the second set of buckets of the hash table serving as the set of less frequently-accessed buckets have been accessed.