Table placement in distributed databases

Patent metadata

Field	Value
Publication number	US-10984002-B2
Application number	US-201916245520-A
Country	US
Kind code	B2
Filing date	Jan 11, 2019
Priority date	Nov 26, 2013
Publication date	Apr 20, 2021
Grant date	Apr 20, 2021

Abstract

A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

First claim

What is claimed is:

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:
identifying a table stored across a plurality of partitions in a distributed database, the distributed database comprising a plurality of tables located on a plurality of distributed nodes;
dividing, based on classification information for the table and a placement rule including a partition threshold defined for the table, at least one of the plurality of partitions into more than one partition by creating a new partition for the at least one of the plurality of partitions, wherein the classification information includes a schema name, a table name, and/or an application type; and
placing, based on the classification information and the placement rule including the partition threshold, the new partition onto at least a portion of available nodes in the plurality of distributed nodes.

2. A computer program product as in claim 1 , wherein a record threshold is specified in a set of placement rules including the placement rule defined for the table.

3. A computer program product as in claim 1 , and wherein the set of placement rules includes partitioning information.

4. A computer program product as in claim 1 , wherein the dividing comprises dividing each of the plurality of partitions into two new partitions.

5. A computer program product as in claim 4 , and wherein the operations further comprise placing each of the new partitions onto at least a portion of the available nodes.

6. A system comprising:
at least one processor; and
at least one memory including program code, which when executed by the at least one processor causes operations comprising:
identifying a table stored across a plurality of partitions in a distributed database, the distributed database comprising a plurality of tables located on a plurality of distributed nodes;
dividing, based on classification information for the table and a placement rule including a partition threshold defined for the table, at least one of the plurality of partitions into more than one partition by creating a new partition for the at least one of the plurality of partitions, wherein the classification information includes a schema name, a table name, and/or an application type; and
placing, based on the classification information and the placement rule including the partition threshold, the new partition onto at least a portion of available nodes in the plurality of distributed nodes.

7. A system as in claim 6 , wherein a record threshold is specified in a set of placement rules including the placement rule defined for the table.

8. A system as in claim 6 , and wherein the set of placement rules includes partitioning information.

9. A system as in claim 6 , wherein the dividing comprises dividing each of the plurality of partitions into two new partitions.

10. A system as in claim 9 , wherein the operations further comprise placing each of the new partitions onto at least a portion of the available nodes.

11. A computer-implemented method comprising:
identifying a table stored across a plurality of partitions in a distributed database, the distributed database comprising a plurality of tables located on a plurality of distributed nodes;
dividing, based on classification information for the table and a placement rule including a partition threshold defined for the table, at least one of the plurality of partitions into more than one partition by creating a new partition for the at least one of the plurality of partitions, wherein the classification information includes a schema name, a table name, and/or an application type; and
placing, based on the classification information and the placement rule including the partition threshold, the new partition onto at least a portion of available nodes in the plurality of distributed nodes.

12. A system as in claim 6 , wherein a record threshold is specified in a set of placement rules including the placement rule defined for the table.

13. A system as in claim 6 , and wherein the set of placement rules includes partitioning information.

14. A system as in claim 6 , wherein the dividing comprises dividing each of the plurality of partitions into two new partitions.

15. A system as in claim 9 , wherein the operations further comprise placing each of the new partitions onto at least a portion of the available nodes.

Assignees

• Sap Se

Inventors

• Leu Hans-Joerg
• Bensberg Christian
• Beigel Johannes
• Becker Jochen
• Mueller Carsten

Classifications

• G06F16/24554 Primary

  Unary operations; Data partitioning operations · CPC title

• G06F16/27 Primary

  Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor · CPC title

• G06F16/2365

  Ensuring data consistency and integrity · CPC title