Data access using decompression maps

• US 9,753,984 B2
• Filed: 06/18/2014
• Issued: 09/05/2017
• Est. Priority Date: 09/19/2013
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Lyle, Robert W.
• Primary Examiner(s): Morrison, Jay
• Assistant Examiner(s): Hoang, Ken
• Application Number:
  US14/307,838
• Publication Number:
  US 20150081651A1
• Time in Patent Office: 1,175 Days
• Field of Search: 707693, 707748, 707E17005, 707E17018, 707E17084, 707640, 707661, 707674, 707696, 707792, 707999001, 707999002, 707999003, 707999004, 707999005, 707999006, 707999009, 7079991, 707999101, 707999102, 707999103, 707999104, 707999107
• CPC Class Codes: G06F 16/1744 using compression, e.g. sparse files
• CPC Class Codes: G06F 16/2365 Ensuring data consistency and integrity
• CPC Class Codes: G06F 16/245 Query processing
• CPC Class Codes: G06F 16/24561 Intermediate data storage techniques for performance improvement

Abstract

Methods and apparatus, including computer program products, implementing and using techniques for decompressing data in a database system. A query is received, which pertains to a subset of data within a compressed set of data. One or more decompression strategies are evaluated using a cost model. The cost model includes an estimated filter factor. A low cost decompression strategy is selected based on the results of the evaluation of the one or more decompression strategies. One or more bytes representing the requested subset of data are located within the compressed set of data. Only a portion of the compressed data that corresponds to the subset of data is decompressed, using the selected decompression strategy, while leaving the remaining set of data in a compressed state.

Claims

1. A computer-implemented method for decompressing data in a database system, comprising:

receiving a query pertaining to a subset of data within a compressed set of data, wherein the subset of data includes one of;

a subset of columns in a row of a database table, a subset of columns or bytes within a row of the database table, and a subset of rows within a page of the database table;

in response to receiving the query, evaluating by the database system two or more potential decompression strategies using a cost model, the cost model including an estimated filter factor;

selecting a low cost decompression strategy based on the results of the evaluation of the two or more decompression strategies;

locating one or more bytes representing the requested subset of data within the compressed set of data, wherein the locating includes;

determining, by the processor, a unit representing a certain number of bytes of compressed data; and

determining, by the processor, what units need to be decompressed to get to the one or more bytes representing the requested subset of data within the compressed set of data;

decompressing only a portion of the compressed data that corresponds to the subset of data, using the selected decompression strategy, while leaving the remaining compressed set of data in an unchanged state; and

storing, by the processor, a map for each row, the map describing offsets to the start of every unit, wherein the map is stored as an array in a memory buffer of the database system.

2. The method of claim 1, wherein the decompression strategy includes two or more decompression phases.

3. The method of claim 1, wherein evaluating one or more decompression strategies includes calculating a cost for decompressing only a subset of columns within a row and comparing the calculated cost with a cost for decompressing all columns within the row.

4. The method of claim 1, wherein every variable length column is preceded by a number describing the length of the variable length column.

5. The method of claim 1, wherein decompressing starts at the beginning of a row.

6. The method of claim 1, wherein decompressing starts at the end of a row.