Hierarchical data compression and computation

Patent metadata

Field	Value
Publication number	US-9514147-B2
Application number	US-201615071372-A
Country	US
Kind code	B2
Filing date	Mar 16, 2016
Priority date	Sep 30, 2014
Publication date	Dec 6, 2016
Grant date	Dec 6, 2016

Abstract

According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.

First claim

What is claimed is:

1. A system for hierarchically compressing data comprising:
one or more processors configured to:
create a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data, and wherein creating a compression hierarchy comprises:
creating a run length encoding compression node in the compression hierarchy of compression nodes;

determine a path of one or more compression nodes through said compression hierarchy, based upon compression statistics, to compress data; and
compress the data by the compression nodes of the path, wherein compressing the data comprises:
performing a filtering operation on the data using the run length encoding compression node, wherein the filtering operation is performed in part by applying a bitmask to a values field of the run length encoding compression node.

2. The system of claim 1 , wherein the one or more processors are configured to select a path of the compression hierarchy having a measure of compression higher than any of the other paths.

3. The system of claim 1 , wherein the compression nodes are configured to compress one or more data types selected from a group consisting of: integer, character and double.

4. The system of claim 1 , wherein each compression node is selected from a group consisting of: a bitshaved compression node, a dictionary compression node, a run length encoding compression node, a character-based compression node and a delta compression node.

5. The system of claim 1 , wherein the one or more processors are configured to:
perform part of a join operation on the data using the run length encoding compression node, wherein the join operation is performed by applying input data to a values field of the run length encoding compression node and by applying repeat counts to a lengths field of the run length encoding compression node.

6. A computer program product for hierarchically compressing data comprising a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code, when executed by a processor, causes the processor to:
create a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data, and wherein creating a compression hierarchy comprises:
creating a run length encoding compression node in the compression hierarchy of compression nodes;

determine a path of one or more compression nodes through said compression hierarchy, based upon compression statistics, to compress data; and
compress the data by the compression nodes of the path, wherein compressing the data comprises:
performing a filtering operation on the data using the run length encoding compression node, wherein the filtering operation is performed in part by applying a bitmask to a values field of the run length encoding compression node.

7. The computer program product of claim 6 , wherein the computer readable program code is configured to cause the processor to select a path of the compression hierarchy having a measure of compression higher than any of the other paths.

8. The computer program product of claim 6 , wherein each compression node is selected from a group consisting of: a bitshaved compression node, a dictionary compression node, a run length encoding compression node, a character-based compression node and a delta compression node.

9. The computer program product of claim 6 , wherein the computer readable program code is configured to cause the processor to:
perform part of a join operation on the data using the run length encoding compression node, wherein the join operation is performed by applying input data to a values field of the run length encoding compression node and by applying repeat counts to a lengths field of the run length encoding compression node.

Assignees

• IBM

Inventors

• Ackerman William B
• Dickie Garth A
• Keller Jeffrey M

Classifications

• H03M7/3088

  employing the use of a dictionary, e.g. LZ78 · CPC title

• G06F17/30153 Primary

  Physics · mapped topic

• H03M7/46 Primary

  Conversion to or from run-length codes, i.e. by representing the number of consecutive digits, or groups of digits, of the same kind by a code word and a digit indicative of that kind · CPC title

• H03M7/6035

  Handling of unkown probabilities · CPC title

• H03M7/6011

  Encoder aspects · CPC title