A computer-implemented method for compressing data records in a database system and for processing said compressed data records, the method comprising the following steps: providing data records with a binary structure; dividing the data records into several bit vectors; reducing the size of each bit vector by: dividing the bit vector into consecutive partial areas of equal size, each partial area consisting of n bits, classifying the partial areas as trivial partial areas, quasi-trivial partial areas and non-trivial partial areas, with trivial partial areas exclusively including bits having the value 0, quasi-trivial partial areas exclusively including bits having the value 1 and non-trivial partial areas including bits having the values 0 and 1 in an arbitrary sequence, combining one non-trivial or several consecutive non-trivial partial areas into one respective R block, and removing the trivial partial areas; and combining one quasi-trivial or several consecutive quasi-trivial partial areas into one respective O block, wherein the step of combining the one non-trivial or the several consecutive non-trivial partial areas into the one respective R block further comprises the steps of: noting an absolute bit vector position P R of a first bit of each non-trivial partial area included in the one respective R block; noting a number m R of the consecutive non-trivial partial areas in the one respective R block, wherein for the number m R the relation m R ≤ n-1 is valid; and selecting at least two bit vectors and combining the at least two bit vectors to one solution vector, wherein the combination of the bit vectors is carried out by the combination of O blocks and/or R blocks of the bit vectors. providing data records with a binary structure; dividing the data records into several bit vectors; reducing the size of each bit vector by: dividing the bit vector into consecutive partial areas of equal size, each partial area consisting of n bits, classifying the partial areas as trivial partial areas, quasi-trivial partial areas and non-trivial partial areas, with trivial partial areas exclusively including bits having the value 0, quasi-trivial partial areas exclusively including bits having the value 1 and non-trivial partial areas including bits having the values 0 and 1 in an arbitrary sequence, combining one non-trivial or several consecutive non-trivial partial areas into one respective R block, and removing the trivial partial areas; and dividing the bit vector into consecutive partial areas of equal size, each partial area consisting of n bits, classifying the partial areas as trivial partial areas, quasi-trivial partial areas and non-trivial partial areas, with trivial partial areas exclusively including bits having the value 0, quasi-trivial partial areas exclusively including bits having the value 1 and non-trivial partial areas including bits having the values 0 and 1 in an arbitrary sequence, combining one non-trivial or several consecutive non-trivial partial areas into one respective R block, and removing the trivial partial areas; and combining one quasi-trivial or several consecutive quasi-trivial partial areas into one respective O block, wherein the step of combining the one non-trivial or the several consecutive non-trivial partial areas into the one respective R block further comprises the steps of: noting an absolute bit vector position P R of a first bit of each non-trivial partial area included in the one respective R block; noting a number m R of the consecutive non-trivial partial areas in the one respective R block, wherein for the number m R the relation m R ≤ n-1 is valid; and selecting at least two bit vectors and combining the at least two bit vectors to one solution vector, wherein the combination of the bit vectors is carried out by the combination of O blocks and/or R blocks of the bit vectors. noting an absolute bit vector position P R of a first bit of each non-trivial partial area included in the one respective R block; noting a number m R of the consecutive non-trivial partial areas in the one respective R block, wherein for the number m R the relation m R ≤ n-1 is valid; and selecting at least two bit vectors and combining the at least two bit vectors to one solution vector, wherein the combination of the bit vectors is carried out by the combination of O blocks and/or R blocks of the bit vectors.