IP Library Granted Patent US 9,323,791
Granted Patent B2
US 9,323,791 · App. 14/296,847 · Granted Apr 26, 2016

Apparatus and method for expanding a shared-nothing system

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,323,791
App. No.
14/296,847
Granted
Apr 26, 2016
Kind
B2
Abstract

A computer readable storage medium includes executable instructions to evaluate an expanded shared-nothing data store configuration. A data redistribution schedule table with specified parameters is formed. Data is redistributed within the expanded shared-nothing data store in accordance with the data redistribution schedule table.

Claims (52)

1. A non-transitory computer readable storage medium, storing instructions which, when executed by a computing system, cause the computing system to perform operations comprising:

responsive to detecting a second node being added to a data store having a first node:

forming a data redistribution schedule table that stores one or more parameters for a redistribution of a set of data stored in a source table to a target table, wherein:

the source table is associated with the first node,

the target table is associated with the second node, and

and

causing the set of data stored in the source table to be redistributed to the target table in accordance with the one or more parameters stored in the data redistribution schedule table, including:

forming the target table on the second node;

copying table definitions from the source table to the target table;

migrating data from the source table to the target table; and

exchanging the target table and the source table responsive to determining that the migration has completed,

wherein each of the first node and second node comprises a respective storage device that is independent from storage devices of other nodes of the data store.

2. The non-transitory computer readable storage medium of claim 1 , wherein the data store is a shared-nothing data store.

3. The non-transitory computer readable storage medium of claim 1 , wherein exchanging the source table with the target table is an atomic transaction.

4. The non-transitory computer readable storage medium of claim 1 , wherein the source table is stored on the first node, and the target table is stored on the second node.

5. The non-transitory computer readable storage medium of claim 4 , the operations further comprising: enabling access to data stored on the first node, while the set of data in the source table is being redistributed to the target table.

6. The non-transitory computer readable storage medium of claim 1 , wherein the one or more parameters include a time parameter specifying a start time, and the operations further comprise: delaying the redistribution of the set of data in accordance with the start time.

7. A method comprising:

responsive to detecting a second node being added to a data store having a first node:

forming a data redistribution schedule table that stores one or more parameters for a redistribution of a set of data stored in a source table to a target table, wherein:

the source table is associated with the first node,

the target table is associated with the second node, and

and

causing the set of data stored in the source table to be redistributed to the target table in accordance with the one or more parameters stored in the data redistribution schedule table, including:

forming the target table on the second node;

copying table definitions from the source table to the target table;

migrating data from the source table to the target table; and

exchanging the target table and the source table responsive to determining that the migration has completed,

wherein each of the first node and second node comprises a respective storage device that is independent from storage devices of other nodes of the data store.

8. The method of claim 7 , wherein the data store is a shared-nothing data store.

9. The method of claim 7 , wherein exchanging the source table with the target table is an atomic transaction.

10. The method of claim 7 , wherein the source table is stored on the first node, and the target table is stored on the second node.

11. The method of claim 10 , further comprising: enabling access to data stored on the first node, while the set of data in the source table is being redistributed to the target table.

12. The method of claim 7 , wherein the one or more parameters include a time parameter specifying a start time, and further comprising: delaying the redistribution of the set of data in accordance with the start time.

13. A system, comprising:

one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising:

responsive to detecting a second node being added to a data store having a first node:

forming a data redistribution schedule table that stores one or more parameters for a redistribution of a set of data stored in a source table to a target table, wherein:

the source table is associated with the first node,

the target table is associated with the second node, and

and

causing the set of data stored in the source table to be redistributed to the target table in accordance with the one or more parameters stored in the data redistribution schedule table, including:

forming the target table on the second node;

copying table definitions from the source table to the target table;

migrating data from the source table to the target table; and

exchanging the target table and the source table responsive to determining that the migration has completed,

wherein each of the first node and second node comprises a respective storage device that is independent from storage devices of other nodes of the data store.

14. The system of claim 13 , wherein the data store is a shared-nothing data store.

15. The system of claim 13 , wherein exchanging the source table with the target table is an atomic transaction.

16. The system of claim 13 , wherein the source table is stored on the first node, and the target table is stored on the second node.

17. The system of claim 16 , the operations further comprising:

enabling access to data stored on the first node, while the set of data in the source table is being redistributed to the target table.

Assignments (5)
MERGER Recorded May 20, 2026
From: PIVOTAL SOFTWARE, INC.
To: VMWARE LLC
Reel/Frame 075613/0980 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 13, 2015
From: HAGENBUCH, BRIAN; SHERRY, GAVIN; COHEN, JEFFREY IRA; PEDROTTI, CHRIS; ESHLEMAN, JOHN GLENN; WAAS, FLORIAN MICHAEL; KENT, JOY
To: GREENPLUM, INC.
Reel/Frame 035398/0073 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 13, 2015
From: GREENPLUM, INC.
To: EMC CORPORATION
Reel/Frame 035398/0352 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 13, 2015
From: EMC CORPORATION
To: GOPIVOTAL, INC.
Reel/Frame 035398/0375 →
CHANGE OF NAME Recorded Apr 13, 2015
From: GOPIVOTAL, INC.
To: PIVOTAL SOFTWARE, INC.
Reel/Frame 035421/0564 →