Unified architecture for hybrid database storage using fragments

• US 9,690,799 B2
• Filed: 02/03/2016
• Issued: 06/27/2017
• Est. Priority Date: 03/12/2013
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP SE
• Inventors: French, Blaine, Thomsen, Dirk, Schreter, Ivan, Florendo, Colin
• Primary Examiner(s): Herndon, Heather
• Assistant Examiner(s): BUI, THUY T
• Application Number:
  US15/015,042
• Publication Number:
  US 20160154815A1
• Time in Patent Office: 510 Days
• Field of Search: 707693
• CPC Class Codes: G06F 16/1744 using compression, e.g. sparse files
• CPC Class Codes: G06F 16/22 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G06F 16/221 Column-oriented storage; Management thereof
• CPC Class Codes: G06F 16/2282 Tablespace storage structures; Management thereof
• CPC Class Codes: G06F 16/23 Updating
• CPC Class Codes: G06F 16/24554 Unary operations; Data partitioning operations
• CPC Class Codes: G06F 3/0608 Saving storage space on storage systems
• CPC Class Codes: G06F 3/0661 Format or protocol conversion arrangements
• CPC Class Codes: G06F 3/0673 Single storage device

Abstract

Data records of a data set can be stored in multiple main part fragments retained in on-disk storage. Each fragment can include a number of data records that is equal to or less than a defined maximum fragment size. Using a compression that is optimized for each fragment, each fragment can be compressed. After reading at least one of the fragments into main system memory from the on-disk storage, an operation can be performed on the fragment or fragments while the in the main system memory.

Claims

1. A computer program product comprising a non-transitory machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:

storing, in a plurality of fragments retained in on-disk storage, a plurality of data records that comprise a data set, each fragment of the plurality of fragments comprising a local row index, a mapping of the local row index to RowID values in a global RowID column for the data set, and a number of data records that is equal to or less than a defined maximum fragment size, the RowID values in the RowID column being unique, logical references to the data records of the data set, the local row index comprising physical locations of the data records in the fragment, the defined maximum fragment size being smaller than an available amount of main system memory to facilitate the loading of each fragment of the plurality of fragments into the main system memory;

compressing each fragment of the plurality of fragments using a compression that is optimized for each fragment;

reading at least one of the plurality of fragments into main system memory from the on-disk storage; and

performing an operation on the at least one of the plurality of fragments while the at least one of the plurality of fragments is in the main system memory;

executing a merge of the data set with a change to the data set, the merge comprising;

creating a temporary, in-memory data structure containing data from a fragment of the plurality of fragments and a committed row from the change to the data set, and

sorting the temporary, in-memory data structure to maximize compression of the plurality of data records; and

storing data from the sorted, temporary, in-memory data structure to a revised fragment.

2. The computer program product as in claim 1, wherein each of the plurality of part fragments comprises at least one row set arranged in a temporal order.

3. The computer program product as in claim 1, wherein the merge further comprises:

copying one or more uncommitted rows from the change of the data set to a delta part of a record.

4. The computer program product as in claim 3, wherein the operations further comprise:

storing cleanup pointers at a start of the merge, the cleanup pointers indicating start and stop locations for the temporary data structure.

5. A system comprising:

at least one processor; and

a machine-readable medium storing instructions that, when executed by the at least one programmable processor, cause the at least one programmable processor to perform operations comprising;

storing, in a plurality of fragments retained in on-disk storage, a plurality of data records that comprise a data set, each fragment of the plurality of fragments comprising a local row index, a mapping of the local row index to RowID values in a global RowID column for the data set, and a number of data records that is equal to or less than a defined maximum fragment size, the RowID values in the RowID column being unique, logical references to the data records of the data set, the local row index comprising physical locations of the data records in the fragment, the defined maximum fragment size being smaller than an available amount of main system memory to facilitate the loading of each fragment of the plurality of fragments into the main system memory;

compressing each fragment of the plurality of fragments using a compression that is optimized for each fragment;

reading at least one of the plurality of fragments into main system memory from the on-disk storage; and

performing an operation on the at least one of the plurality of fragments while the at least one of the plurality of fragments is in the main system memory;

executing a merge of the data set with a change to the data set, the merge comprising;

creating a temporary, in-memory data structure containing data from a fragment of the plurality of fragments and a committed row from the change to the data set, and

sorting the temporary, in-memory data structure to maximize compression of the plurality of data records; and

storing data from the sorted, temporary, in-memory data structure to a revised fragment.

6. The system as in claim 5, wherein each of the plurality of part fragments comprises at least one row set arranged in a temporal order.

7. The system as in claim 5, wherein the merge further comprises:

copying one or more uncommitted rows from the change of the data set to a delta part of a record.

8. The system as in claim 7, wherein the operations further comprise:

storing cleanup pointers at a start of the merge, the cleanup pointers indicating start and stop locations for the temporary data structure.

9. A computer-implemented method comprising:

storing, in a plurality of fragments retained in on-disk storage, a plurality of data records that comprise a data set, each fragment of the plurality of fragments comprising a local row index, a mapping of the local row index to RowID values in a global RowID column for the data set, and a number of data records that is equal to or less than a defined maximum fragment size, the RowID values in the RowID column being unique, logical references to the data records of the data set, the local row index comprising physical locations of the data records in the fragment, the defined maximum fragment size being smaller than an available amount of main system memory to facilitate the loading of each fragment of the plurality of fragments into the main system memory;

compressing each fragment of the plurality of fragments using a compression that is optimized for each fragment;

reading at least one of the plurality of fragments into main system memory from the on-disk storage; and

performing an operation on the at least one of the plurality of fragments while the at least one of the plurality of fragments is in the main system memory;

executing a merge of the data set with a change to the data set, the merge comprising;

creating a temporary, in-memory data structure containing data from a fragment of the plurality of fragments and a committed row from the change to the data set, and

sorting the temporary, in-memory data structure to maximize compression of the plurality of data records; and

storing data from the sorted, temporary, in-memory data structure to a revised fragment.

10. The computer-implemented method as in claim 9, wherein each of the plurality of part fragments comprises at least one row set arranged in a temporal order.

11. The computer-implemented method as in claim 9, wherein the merge further comprises:

copying one or more uncommitted rows from the change of the data set to a delta part of a record.

12. The computer-implemented method as in claim 11, further comprising:

storing cleanup pointers at a start of the merge, the cleanup pointers indicating start and stop locations for the temporary data structure.

13. The computer-implemented method as in claim 9, wherein at least one of the storing, the compressing, the reading, the performing, and the executing are performed by a system comprising at least one programmable processor.