Techniques to balance log structured merge trees

A method, comprising:

• transferring one or more key blocks to a root node of a data structure comprising the root node and one or more leaf nodes, wherein each key block of the one or more key blocks comprises a respective plurality of keys;
• merging a plurality of key blocks including the one or more key blocks into a combined key block based at least in part on determining that the plurality of key blocks of the root node satisfies a threshold;
• transferring the combined key block to a leaf node of the one or more leaf nodes in accordance with merging the plurality of key blocks;
• determining that the leaf node satisfies a second threshold based at least in part on transferring the combined key block to the leaf node;
• and
• splitting the leaf node into at least a first leaf node and a second leaf node based at least in part on the determining, wherein the first leaf node comprises one or more first keys that are less than or equal to a selected key, and wherein the second leaf node comprises one or more second keys that are greater than the selected key.

A non-transitory computer-readable medium storing code, the code comprising instructions executable by one or more processors to:

• transfer one or more key blocks to a root node of a data structure comprising the root node and one or more leaf nodes, wherein each key block of the one or more key blocks comprises a respective plurality of keys;
• merge a plurality of key blocks including the one or more key blocks into a combined key block based at least in part on determining that the plurality of key blocks of the root node satisfies a threshold;
• transfer the combined key block to a leaf node of the one or more leaf nodes in accordance with merging the plurality of key blocks;
• determine that the leaf node satisfies a second threshold based at least in part on transferring the combined key block to the leaf node;
• and
• split the leaf node into at least a first leaf node and a second leaf node based at least in part on the determining, wherein the first leaf node comprises one or more first keys that are less than or equal to a selected key, and wherein the second leaf node comprises one or more second keys that are greater than the selected key.