System and method for efficient expansion of key value hash table

A method of managing key-value (KV) data in non-volatile memory, comprising:

• generating, by a processor, a first key from a key-value (KV) pair;
• reading, by the processor based on the first key, a first entry of a hash table stored in volatile memory;
• reading, by the processor based on the first entry of the hash table, a first page including a set of KV hash entries each containing a location of non-volatile memory;
• determining, by the processor, whether the number of entries of the first page reaches a predetermined number;
• in response to determining that the number of entries of the first page reaches the predetermined number, storing, by the processor, KV data corresponding to the KV pair in a first location of the non-volatile memory, writing a first KV hash entry containing the first location of the non-volatile memory, and writing a location of the first KV hash entry in a second entry of the hash table;
• and
• in response to determining that the number of entries of the first page does not reach the predetermined number, storing, by the processor, KV data corresponding to the KV pair in a second location of the non-volatile memory, and adding to the first page a new KV hash entry containing the second location of the non-volatile memory.