Binary method for locating data rows in a compressed data block
AssigneeCA, Inc.
InventorsKevin P. Shuma, Joseph B. Lynn, Robert Florian
Life of this patent
Estimating the term…
Abstract
A system and method is provided for locating one or more compressed data rows in a data block. A 16 byte “row map” may be added at the end of each compressed data block. The row map may provide seven binary address points in the compressed data block (i.e., by dividing the compressed data block into 8ths).
Claims18
A computer-implemented method for locating one or more compressed data rows in a data block, the method executed by one or more processors configured to perform a plurality of operations, the operations comprising:
- receiving a request to locate at least one compressed data row of the one or more compressed data rows in the data block;
- determining a data row pointer for the at least one compressed data row;
- accessing a row map data structure contained within the data block, wherein the row map data structure is configured to include a plurality of binary ⅛th physical address points, and wherein the plurality of binary ⅛th physical address points were determined by dividing the data block into eight sub-blocks;
- performing a binary search to determine a sub-block within the data block in which the at least one compressed data row resides based on the row map data structure;
- and
- locating the at least one compressed data row in the determined sub-block based on the data row pointer.
A non-transitory computer-readable storage medium having one or more computer-readable instructions thereon which when executed by one or more processors cause the one or more processors to:
- receive a request to locate at least one compressed data row of one or more compressed data rows in a data block;
- determine a data row pointer for the at least one compressed data row;
- accessing a row map data structure contained within the data block, wherein the row map data structure is configured to include a plurality of binary ⅛th physical address points, and wherein the plurality of binary ⅛th physical address points were determined by dividing the data block into eight sub-blocks;
- performing a binary search to determine a sub-block within the data block in which the at least one compressed data row resides based on the row map data structure;
- and
- locate the at least one compressed data row in the determined sub-block based on the data row pointer.
A computer-implemented system for locating one or more compressed data rows in a data block, the system comprising:
- one or more processors configured to:
- receive a request to locate at least one compressed data row of the one or more compressed data rows in the data block;
- determine a data row pointer for the at least one compressed data row;
- accessing a row map data structure contained within the data block, wherein the row map data structure is configured to include a plurality of binary ⅛th physical address points, and wherein the plurality of binary ⅛th physical address points were determined by dividing the data block into eight sub-blocks;
- performing a binary search to determine a sub-block within the data block in which the at least one compressed data row resides based on the row map data structure;
- and
- locate the at least one compressed data row in the determined sub-block based on the data row pointer.
Dependencies are inferred from the claim text.