Data compression for sort/merge processing

A computer-implemented method, the method comprising:

• receiving a winning offset code value from a merge bracket having a plurality of nodes, the merge bracket being used to merge a plurality of sorted sequences of sort keys by comparing pairs of the sort keys until a winning sort key is determined, wherein the sort keys are represented by corresponding offset code values determined from relative values of pairs of sort keys, and the winning offset code value represents the winning sort key of the merge bracket;
• determining, from the winning offset code value, a removed portion of the winning sort key to remove;
• determining a reduction value characterizing a size of the removed portion;
• determining, from the winning offset code value, a retained portion of the winning sort key to retain;
• and
• storing the reduction value and the retained portion of the winning sort key.

A system comprising:

• at least one memory including instructions;
• and
• at least one processor that is operably coupled to the at least one memory and that is arranged and configured to execute instructions that, when executed, cause the at least one processor to:
• receive a winning offset code value from a merge bracket having a plurality of nodes, the merge bracket being used to merge a plurality of sorted sequences of sort keys by comparing pairs of the sort keys until a winning sort key is determined, wherein the sort keys are represented by corresponding offset code values determined from relative values of pairs of sort keys, and the winning offset code value represents the winning sort key of the merge bracket;
• determine, from the winning offset code value, a removed portion of the winning sort key to remove;
• determine a reduction value characterizing a size of the removed portion;
• determine, from the winning offset code value, a retained portion of the winning sort key to retain;
• and
• store the reduction value and the retained portion of the winning sort key.