Rolling subpartition management

Patent metadata

Field	Value
Publication number	US-10108690-B1
Application number	US-201313912076-A
Country	US
Kind code	B1
Filing date	Jun 6, 2013
Priority date	Jun 6, 2013
Publication date	Oct 23, 2018
Grant date	Oct 23, 2018

Abstract

Tables in the database management system may be divided into partitions, and partitions may be further subdivided into subpartitions. Subpartitions may be ordered on time or date values and boundaries between subpartitions may be defined based on various time-based intervals. A subpartition management policy may be defined. Older subpartitions may be automatically deleted, moved to archival storage or moved to a secondary database. Subpartitions may be automatically created and reserved for future use. Preexisting subpartitions may be automatically split and merged into new subpartitions conformant to the subpartition management policy.

First claim

What is claimed is:

1. A database management system comprising:
one or more storage devices configured to store thereon one or more files corresponding to data of a partition of a database table, the data having corresponding time information; and
one or more memories having stored thereon computer-readable instructions that, upon execution, cause the system at least to:
store, on at least one of the one or more storage devices, a plurality of subpartitions of the partition, each subpartition having an assigned time interval and containing a subset of the data, the subset of the data having corresponding time information within the assigned time interval;
store, on at least one of the one or more storage devices, another subpartition upon determining that a count of the plurality of subpartitions is less than a minimum number of subpartitions, the another subpartition having an another assigned time interval later in time relative to the assigned time interval assigned to each subpartition in the plurality of subpartitions and containing data having corresponding time information within the another assigned time interval; and
remove, from the at least one of the one or more storage devices, one of the plurality of subpartitions when a count of subpartitions exceeds a value indicative of a maximum number of subpartitions, the removed one of the plurality of subpartitions having an earliest assigned time interval.

2. The system of claim 1 , further comprising one or more memories having stored thereon computer-readable instructions that, upon execution, cause the system at least to:
name the another subpartition using a naming pattern indicative of the another assigned time interval.

3. The system of claim 1 , further comprising one or more memories having stored thereon computer-readable instructions that, upon execution, cause the system at least to:
reserve space in the another subpartition based at least in part on an expected amount of data to be stored in the another subpartition.

4. The system of claim 1 , further comprising one or more memories having stored thereon computer-readable instructions that, upon execution, cause the system at least to:
cause the removed one of the plurality of subpartitions to be stored on one or more of hosted storage, archival storage, customer-provided storage, and a secondary database management system.

5. A computer-implemented method comprising:
storing, by a computing node, a plurality of subpartitions of a partition of a database table, each subpartition having an assigned interval and containing a subset of data associated with the partition, the subset of the data comprising corresponding ordering information within the assigned interval;
storing, by a computing node, another subpartition upon determining that a count of the plurality of subpartitions is less than a minimum number of subpartitions, the another subpartition containing data within a last-ordered assigned interval relative to the assigned interval of each subpartition in the plurality of subpartitions; and
removing, by a computing node, one of the plurality of subpartitions when a count of subpartitions exceeds a value indicative of a maximum number of subpartitions, the removed one of the plurality of subpartitions having a first-ordered assigned interval.

6. The method of claim 5 , further comprising:
naming the another subpartition to conform with a naming pattern indicative of the assigned interval.

7. The method of claim 5 , wherein the subset of the data corresponds to a plurality of preexisting subpartitions, the plurality of preexisting subpartitions each having a second assigned interval different than the assigned interval.

8. The method of claim 7 , further comprising:
forming a plurality of temporary subpartition structures corresponding to the plurality of preexisting subpartitions, the plurality of temporary subpartitions corresponding to the second interval.

9. The method of claim 5 , further comprising:
reserving space in the another subpartition based at least in part on an expected amount of data to be stored in the another subpartition.

10. The method of claim 5 , further comprising:
causing the removed one of the plurality of subpartitions to be stored on one or more of hosted storage, archival storage, customer-provided storage, and a secondary database management system.

11. The method of claim 10 , further comprising:
retrieving the removed one of the plurality of subpartitions from one of hosted storage, archival storage, or customer-provided storage.

12. The method of claim 5 , further comprising:
causing the removed one of the plurality of subpartitions to be activated on a secondary database management system.

13. The method of claim 5 , wherein the last-ordered assigned interval is a future interval.

14. A non-transitory computer-readable storage medium having stored thereon instructions that, upon execution by a computing device, cause the computing device at least to:
store a plurality of subpartitions of a partition of a database table, each subpartition having an assigned interval and containing a subset of data associated with the partition, the subset of the data comprising corresponding ordering information within the assigned interval;
store another subpartition upon determining that a count of the plurality of subpartitions is less than a minimum number of subpartitions, the another subpartition containing data in a last-ordered assigned interval relative to the assigned interval of each subpartition in the plurality of subpartitions; and
remove one of the plurality of subpartitions when a count of subpartitions exceeds a value indicative of a maximum number of subpartitions, the removed one of the plurality of subpartitions having a first-ordered assigned interval.

15. The non-transitory computer-readable medium of claim 14 , comprising further instructions that, upon execution by the computing device, cause the computing device to at least:
copy data from a preexisting subpartition that does not conform to a subpartition management policy to at least one of the plurality of subpartitions.

16. The non-transitory computer-readable medium of claim 15 , comprising further instructions that, upon execution by the computing device, cause the computing device to at least:
remove the subpartition that does not conform to the subpartition management policy.

17. The non-transitory computer-readable medium of claim 14 , comprising further instructions that, upon execution by the computing device, cause the computing device to at least: store information indicative of a subpartition management policy in a second database table.

18. The non-transitory computer-readable medium of claim 14 , comprising further instructions that, upon execution by the computing device, cause the computing device to at least:
reserve space in another subpartition based at least in part on an expected amount of data to be stored in the another subpartition.

19. The non-transitory computer-readable medium of claim 14 , comprising further instructions that, upon execution by the computing device, cause the computing device to at least:
name the another subpartition using a naming pattern comprising a prefix and a suffix pattern.

20. The non-transitory computer-readable medium of claim 14 , wherein removing a subpartition comprises one or more of causing a database to drop the removed subpartition, deleting files corresponding to the removed subpartition, copying files cor

Assignees

• Amazon Tech Inc

Inventors

• Murray Edward Paul

Classifications

• G06F16/278 Primary

  Data partitioning, e.g. horizontal or vertical partitioning · CPC title

• G06F17/30584 Primary

  Physics · mapped topic