Adaptive compression optimization for effective pruning

A system comprising:

• at least one processor;
• and
• at least one memory including code which when executed by the at least one processor causes operations comprising:
• reordering, by a database management system, at least a first data vector for a first column of a database table and a second data vector for a second column of the database table using a forward pass followed by a backward pass, wherein the forward pass sorts, based on frequency of occurrence, at least the first data vector and the second data vector, wherein the backward pass prioritizes a selection order of the first data vector or the second data vector based on a number of distinct value identifiers in a rest range of at least one of the first data vector or the second data vector, wherein the backward pass sorts by sorting the rest range in at least the first data vector and the second data vector by at least grouping close value identifiers together, wherein at least one rest range is prevented from being split during the sorting;
• determining, by the database management system and for at least the first data vector, a prefix part and a non-prefix part;
• generating, by the database management system, a min-max index for the non-prefix part associated with the first data vector;
• and
• storing, for at least the first data vector, a value of the prefix part and a length of the prefix part.

A non-transitory computer-readable medium storing instructions that, when executed by a computer, cause operations comprising:

• reordering, by a database management system, at least a first data vector for a first column of a database table and a second data vector for a second column of the database table using a forward pass followed by a backward pass, wherein the forward pass sorts, based on frequency of occurrence, at least the first data vector and the second data vector, wherein the backward pass prioritizes a selection order of the first data vector or the second data vector based on a number of distinct value identifiers in a rest range of at least one of the first data vector or the second data vector, wherein the backward pass sorts by sorting the rest range in at least the first data vector and the second data vector by at least grouping close value identifiers together, wherein at least one rest range is prevented from being split during the sorting;
• determining, by the database management system and for at least the first data vector, a prefix part and a non-prefix part;
• generating, by the database management system, a min-max index for the non-prefix part associated with the first data vector;
• and
• storing, for at least the first data vector, a value of the prefix part and a length of the prefix part.