Self-balancing tree data structure compression

A system for managing a memory data structure in a computing environment, the system comprising:

• at least one processor, coupled to a memory, and configured to:
• receive a data element to be inserted into the memory data structure, wherein the data element is represented by a key and a value;
• determine a target node in the memory data structure into which the received data element is to be inserted based on the key of the received data element;
• determine whether or not the target node is already compressed;
• perform an append-write operation to insert the data element into the target node when the target node is already compressed;
• perform an evaluation prior to inserting the data element when the target node is not already compressed;
• perform an in-place write operation to insert the data element into the uncompressed target node when the evaluation generates a first result;
• and
• compress the target node and then performing an append-write operation to insert the data element into the compressed target node when the evaluation generates a second result.

An article of manufacture for managing a memory data structure in a computing environment, the article of manufacture comprising a processor-readable storage medium having encoded therein executable code of one or more software programs, wherein the one or more software programs when executed by at least one processing device implement the steps of:

• receiving a data element to be inserted into the memory data structure, wherein the data element is represented by a key and a value;
• determining a target node in the memory data structure into which the received data element is to be inserted based on the key of the received data element;
• determining whether or not the target node is already compressed;
• performing an append-write operation to insert the data element into the target node when the target node is already compressed;
• performing an evaluation prior to inserting the data element when the target node is not already compressed;
• performing an in-place write operation to insert the data element into the uncompressed target node when the evaluation generates a first result;
• and
• compressing the target node and then performing an append-write operation to insert the data element into the compressed target node when the evaluation generates a second result.