Efficient key collision handling

A computer-implemented method for providing efficient key collision handling, the method comprising:

• storing, in a non-volatile memory, a plurality of key-value inode descriptors each including a key from among a plurality of keys and an associated value from among a plurality of values;
• storing, in a volatile memory, a key hash tree and a collision hash tree;
• storing, in the key hash tree, a first plurality of nodes each having a hash of at least one of the plurality of keys;
• and
• storing, in the collision hash tree, a second plurality of nodes each having a collided hash that is associated with two different keys from among the plurality of keys.

A computer-implemented method for providing efficient key collision handling, the method comprising:

• generating a key hash using a hash function;
• allocating at least one of a new logical block address (LBA) or a bytes offset within a partially used LBA;
• generating a key-value inode descriptor;
• storing a key-value pair in the key-value inode descriptor;
• writing the key-value inode descriptor to the at least one of the new LBA or the bytes offset within the partially used LBA;
• generating a binary tree node including the key hash and a key-value inode number for the key-value inode descriptor;
• inserting, the binary tree node, into a key hash tree in a volatile memory;
• determining whether a hash collision has occurred;
• and
• in response to determining that the hash collision has occurred, generating a collision tree node including the key hash and a start address for a collision linked list.