DATA PLACEMENT TRANSPARENCY FOR HIGH AVAILABILITY AND LOAD BALANCING

• US 20100082551A1
• Filed: 09/26/2008
• Published: 04/01/2010
• Est. Priority Date: 09/26/2008
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Ludeman, John, Wu, Ming Chuan, Shrinivas, Ashwin, Gerber, Robert H., Sreenivas, Mahesh K., Zhu, Yixue, Kathuria, Vishal
• Application Number:
  US12/238,852
• Publication Number:
  US 20100082551A1
• Time in Patent Office: Days
• US Class Current: 707/674
• CPC Class Codes: G06F 16/24524 Access plan code generation and invalidation; Reuse of access plans
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor

Abstract

A method of updating a clone data map associated with a plurality of nodes of a computer system is disclosed. The clone data map includes node identification data and clone location data. A node failure event of a failed node of the computer system that supports a primary clone is detected. The clone data map is updated such that a secondary clone stored at a node other than the failed node is marked as a new primary clone. In addition, clone data maps may be used to perform node load balancing by placing a substantially similar number of primary clones on each node of a node cluster or may be used to increase or decrease a number of nodes of the node cluster. Further, data fragments that have a heavy usage or a large fragment size may be reduced in size by performing one or more data fragment split operations.

Claims

1. A method of updating a clone data map associated with a plurality of nodes of a computer system, the method comprising:

detecting a node failure event of a failed node, the failed node comprising one of the plurality of nodes of the computer system, wherein the failed node includes a primary clone and a secondary clone;

for the primary clone, in response to the detected node failure event, updating the clone data map, the clone data map including node identification data and clone location data, wherein the clone data map is updated such that a secondary clone on a node other than the failed node is marked as a new primary clone.

2. The method of claim 1, wherein in response to the detected node failure event, the clone data map is updated such that the primary clone is marked as a first offline clone and the secondary clone on the failed node is marked as a second offline clone.

3. The method of claim 2, further comprising detecting a node recovery event of the failed node and performing a clone refresh operation on the first offline clone and on the second offline clone, and updating the clone data map to mark the first offline clone as primary and to mark the second offline clone as secondary.

4. The method of claim 1, wherein an application accesses data by retrieving the new primary clone prior to a recovery event of the failed node.

5. A method of adding a node to a node cluster, the method comprising:

identifying a set of clones to migrate to a new node of a computing system, each clone in the set of clones comprising a replicated data fragment stored at a different storage location at the computing system;

creating an entry in a clone data map for the new node for each of the clones in the set of clones to generate new clones;

refreshing each of the new clones from a corresponding current primary clone in the set of clones to generate new refreshed clones; and

designating each of the new refreshed clones as either primary or secondary in the clone data map.

6. The method of claim 5, wherein the different storage location is a different node or a different memory location.

7. The method of claim 5, wherein a first new clone is set as a new primary clone in the clone data map and a second new clone is set as a new secondary clone in the clone data map.

8. The method of claim 5, wherein a new empty clone is created by adding the clone entry to a clone data map.

9. The method of claim 5, wherein the state of each of the new refreshed clones is set by writing a state entry in the clone data map associated with the clone entry.

10. The method of claim 5, wherein refreshing each of the new clones from the corresponding current primary clone includes retrieving data from memory at the location of the corresponding current primary clone and then copying that data and storing that data in memory at the new clone locations.

11. The method of claim 5, further comprising determining that each of the clones in the set of clones is either primary or secondary, and wherein when a particular clone to be migrated is a primary clone, the particular clone is designated as a new primary clone and an old clone is designated as a secondary clone.

12. The method of claim 11, further comprising deleting old, obsolete or out-of-date clones in the set of clones.

13. The method of claim 5, wherein the set of clones to migrate includes all of the clones on a node of the computing system, and wherein the node of the computing system is removed from the node cluster.

14. A computer-readable medium, comprising:

instructions, that when executed by a processor, cause the processor to identify fragments in a set of data fragments that have heavy usage or that have a large fragment size;

instructions, that when executed by the processor, cause the processor to reduce the size of the identified fragments until a load on each of the identified fragments is substantially the same as the other fragments, wherein the size of the data fragment is reduced by performing one or more data fragment split operations that are non-observable by an associated application;

instructions, that when executed by the processor after reducing the size of the identified fragments, cause the processor to perform node load balancing by placing a substantially similar number of primary clones on each node of a node cluster.

15. The computer-readable medium of claim 14, further comprising instructions that, when executed by the processor, cause the processor to create a set of data fragments, each data fragment having a substantially similar size.

16. The computer-readable medium of claim 14, wherein after the load balancing, a substantially similar number of secondary clones are placed on each node of the node cluster.

17. The computer-readable medium of claim 14, wherein nodes are selected for placement on nodes of the node cluster using a round robin method.

18. The computer-readable medium of claim 14, wherein the application is a business application and wherein the data fragments are associated with data of a structured query language (SQL) server.

19. The computer-readable medium of claim 14, wherein at least one of the identified fragments is a partitioned data item associated with a database object.

20. The computer-readable medium of claim 14, wherein when a node fails, the clones on the failed node are distributed across all the other nodes of the node cluster.