Method and system for compressing data records and for processing compressed data records
AssigneeParstream GmbH
InventorsJorg Bienert, Michael Hummel, Norbert Heusser
Life of this patent
Estimating the term…
Abstract
System and method to compress data records by 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, combining one non-trivial or several consecutive non-trivial partial areas into one so named R block, and removing the trivial partial areas; as well as combining one quasi-trivial or several consecutive quasi-trivial partial areas into one so named O block.
Claims23
A method for compressing data records in a database system, the method comprising the following steps:
- providing data records to a database system with a binary structure;
- dividing the data records in said database system into several bit vectors;
- reducing the size of each bit vector in said database system by dividing the bit vector into consecutive partial areas of equal size, each said partial consecutive area consisting of n bits;
- classifying the partial areas in said database system as trivial partial areas, quasi-trivial partial areas and non-trivial partial areas;
- combining several consecutive non-trivial partial areas into one respective R block by noting an absolute bit vector position PR of a first bit of each non-trivial partial area of the several consecutive non-trivial partial areas included in the respective R block, and noting a number mR of the several consecutive non-trivial partial areas in the respective R block, wherein for the number mR the relation mR≦−1 is valid;
- removing the trivial partial areas;
- and
- combining a first quasi-trivial partial area or several consecutive quasi-trivial partial areas into one respective O block in said database system.
A data storage medium for storing data collections and compressing data records in a database system comprising a data collection stored thereon, the data collection consisting of a set of data records with each of the data records being reduced to one of at least one R block and at least one O block;
- the at least one R block has several consecutive non-trivial partial areas of the respective data record, each of said several consecutive non-trivial partial areas consisting of n bits, each R block of the at least one R block comprising an absolute bit vector position PR of a first bit of a first non-trivial partial area included in the respective R block and a number mR of the consecutive non-trivial partial areas in the respective R block, wherein for the number mR the relation mR≦n−1 is valid, and
- the O block has a first quasi-trivial partial area or several consecutive quasi-trivial partial areas of the respective data record.
Dependencies are inferred from the claim text.