Method and system for hash key memory footprint reduction

A method for retrieving data from a hash table, the method comprising:

• receiving an index;
• retrieving compressed data stored at the index of the hash table;
• determining a set number based on the index and an associativity, the associativity indicating a capacity of the hash set;
• determining whether wrapping is required;
• if wrapping is required,
• expanding the compressed data based on the set number and a total number of sets in the hash table;
• and
• otherwise,
• expanding the compressed data based on the set number.

A storage device for storing data in a hash table, the storage device comprising:

• a host interface for communicating with a host device;
• a memory for storing data;
• a memory controller comprising logic stored in a computer readable medium, the logic configured to:
• receive data;
• determine a location identifier for the data, wherein the location identifier identifies a location in the hash table for storing the data, and the location identifier is derived from the data;
• compress the data by extracting the location identifier;
• and
• store the compressed data in the identified location of the hash table.

A non-transitory computer program product, tangibly embodied in a computer-readable medium, the computer program product including instructions operable to cause a data processing apparatus to:

• receive data;
• determine a location identifier for the data, wherein the location identifier identifies a location in the hash table for storing the data, and the location identifier is derived from the data;
• compress the data by extracting the location identifier;
• and
• store the compressed data in the identified location of the hash table.