Update-correlations based overwrite mechanism

An information handling system, comprising:

• a processor;
• and
• a memory storing instructions that when executed cause the processor to perform operations including:
• acquiring a plurality of data chunks for a duration of at least one time slice;
• determining an overwrite frequency for the duration of the time slice of each of the data chunks, clustering the data chunks according to the overwrite frequency, and determining an overwrite frequency label for each cluster of the data chunks;
• determining a read frequency for the duration of the time slice of each of the data chunks, clustering the data chunks based on the read frequency, and determining a read frequency label for each of the cluster of the data chunks;
• and
• constructing a sorted tree based on the overwrite frequency label, the read frequency label, and a virtual logical block address of each of the data chunks, wherein a first index of a first parent node in a first level of the sorted tree is based on the overwrite frequency label, and wherein a second index of a second parent node in a second level of the sorted tree is based on the read frequency label.

A non-transitory computer-readable medium to store instructions that are executable to perform operations comprising:

• acquiring a plurality of data chunks for a duration of at least one time slice;
• determining an overwrite frequency for the duration of the time slice of each of the data chunks, clustering the data chunks according to the overwrite frequency, and determining an overwrite frequency label for each cluster of the data chunks;
• determining a read frequency for the duration of the time slice of each of the data chunks, clustering the data chunks based on the read frequency, and determining a read frequency label for each of the cluster of the data chunks;
• and
• constructing a sorted tree based on the overwrite frequency label, the read frequency label, and a virtual logical block address of each of the data chunks, wherein a first index of a first parent node in a first level of the sorted tree is based on the overwrite frequency label, and wherein a second index of a second parent node in a second level of the sorted tree is based on the read frequency label.