Distributed data management system

• US 8,504,521 B2
• Filed: 04/11/2011
• Issued: 08/06/2013
• Est. Priority Date: 07/28/2005
• Status: Active Grant

• Current Assignee: Pivotal Software, Inc. (Broadcom, Inc.)
• Original Assignee: Gopivotal, Inc. (Broadcom, Inc.)
• Inventors: Okamoto, Russell
• Primary Examiner(s): TRUONG, CAM Y T
• Application Number:
  US13/083,664
• Publication Number:
  US 20110191389A1
• Time in Patent Office: 848 Days
• Field of Search: 707/626, 707/704
• US Class Current: 707/626
• CPC Class Codes: G06F 16/00 Information retrieval; Database structures therefor; File system structures therefor
• CPC Class Codes: G06F 16/214 Database migration support

Abstract

A distributed data management system has multiple virtual machine nodes operating on multiple computers that are in communication with each other over a computer network. Each virtual machine node includes at least one data store or “bucket” for receiving data. A digital hash map data structure is stored in a computer readable medium of at least one of the multiple computers to configure the multiple virtual machine nodes and buckets to provide concurrent, non-blocking access to data in the buckets, the digital hash map data structure including a mapping between the virtual machine nodes and the buckets. The distributed data management system employing dynamic scalability in which one or more buckets from a virtual machine node reaching a memory capacity threshold are transferred to another virtual machine node that is below its memory capacity threshold.

Claims

1. A method for storing data objects among a plurality of database management nodes operating on a plurality of computers in communication with each other over a computer network, the method comprising:

maintaining a global data structure in at least one of the database management nodes, wherein the global data structure maps each logical data store of a plurality of logical data stores to a corresponding one of the database management nodes in which the logical data store is stored and, upon receipt of a key value identifying a data object, provides an identity of a database management node storing a logical data store in which the data object is stored;

storing a first data object in a first logical data store selected from the plurality of logical data stores, wherein the first logical data store corresponds to a key value of the first data object;

upon determining that memory consumption of a first database management node corresponding to the first logical data store exceeds a predetermined threshold, sending requests from the first database management node to one or more of the plurality of database management nodes in order to determine whether any one of the plurality of database management nodes has memory to accommodate the first logical data store;

identifying a second database management node from the one or more of the plurality of database management nodes that responds to the requests with replies affirming having memory to accommodate the first logical data store;

enabling migration of the first logical data store from the first database management node to the second database management node to rebalance memory consumption among the database management nodes while simultaneously allowing concurrent and non-blocking access to data objects stored in other logical data stores that are not involved in the migration; and

blocking access to logical data stores that are being migrated until the migration successfully completes.

2. The method of claim 1, wherein the global data structure is divided into partitions that are each stored in a different database management node.

3. The method of claim 1, further comprising hashing a received key value identifying a data object, wherein a resulting hash value identifies a logical data store in which the data object is stored.

4. The method of claim 1, wherein the at least one of the database management nodes maintaining the global data structure further maintains a cache comprising recently accessed data objects.

5. The method of claim 4, further comprising, upon receiving a request for a value of a data object that is stored the cache, transmitting the value to a database management node that stores a logical data store corresponding to the data object in order to confirm that the value of the data object stored in the cache is current.

6. The method of claim 1, wherein data is stored in the logical data stores in a compressed format.

7. A non-transitory computer-readable storage medium comprising instructions for storing data objects among a plurality of database management nodes operating on a plurality of computers in communication with each other over a computer network by carrying out the steps of:

maintaining a global data structure in at least one of the database management nodes, wherein the global data structure maps each logical data store of a plurality of logical data stores to a corresponding one of the database management nodes in which the logical data store is stored and, upon receipt of a key value identifying a data object, provides an identity of a database management node storing a logical data store in which the data object is stored;

storing a first data object in a first logical data store selected from the plurality of logical data stores, wherein the first logical data store corresponds to a key value of the first data object;

upon determining that memory consumption of a first database management node corresponding to the first logical data store exceeds a predetermined threshold, sending requests from the first database management node to one or more of the plurality of database management nodes in order to determine whether any one of the plurality of database management nodes has memory to accommodate the first logical data store;

identifying a second database management node from the one or more of the plurality of database management nodes that responds to the requests with replies affirming having memory to accommodate the first logical data store;

enabling migration of the first logical data store from the first database management node to the second database management node to rebalance memory consumption among the database management nodes while simultaneously allowing concurrent and non-blocking access to data objects stored in other logical data stores that are not involved in the migration; and

blocking access to logical data stores that are being migrated until the migration successfully completes.

8. The non-transitory computer-readable storage medium of claim 7, wherein the global data structure is divided into partitions that are each stored in a different database management node.

9. The non-transitory computer-readable storage medium of claim 7, further carrying out the step of hashing a received key value identifying a data object, wherein a resulting hash value identifies a logical data store in which the data object is stored.

10. The non-transitory computer-readable storage medium of claim 7, wherein the at least one of the database management nodes maintaining the global data structure further maintains a cache comprising recently accessed data objects.

11. The non-transitory computer-readable storage medium of claim 10, further carrying out the step of, upon receiving a request for a value of a data object that is stored the cache, transmitting the value to a database management node that stores a logical data store corresponding to the data object in order to confirm that the value of the data object stored in the cache is current.

12. The non-transitory computer-readable storage medium of claim 7, wherein data is stored in the logical data stores in a compressed format.

13. A distributed data management system comprising a plurality of computers, each computer including a memory and in communication with each other over a computer network, wherein the plurality of computers are configured to support execution of a plurality database management nodes and are configured to:

maintain a global data structure in at least one of the database management nodes, wherein the global data structure maps each logical data store of a plurality of logical data stores to a corresponding one of the database management nodes in which the logical data store is stored and, upon receipt of a key value identifying a data object, provides an identity of a database management node storing a logical data store in which the data object is stored;

store a first data object in a first logical data store selected from the plurality of logical data stores, wherein the first logical data store corresponds to a key value of the first data object;

upon determining that memory consumption of a first database management node corresponding to the first logical data store exceeds a predetermined threshold, send requests from the first database management node to one or more of the plurality of database management nodes in order to determine whether any one of the plurality of database management nodes has memory to accommodate the first logical data store;

identify a second database management node from the one or more of the plurality of database management nodes that responds to the requests with replies affirming having memory to accommodate the first logical data store;

enable migration of the first logical data store from the first database management node to the second database management node to rebalance memory consumption among the database management nodes while simultaneously allowing concurrent and non-blocking access to data objects stored in other logical data stores that are not involved in the migration; and

blocking access to logical data stores that are being migrated until the migration successfully completes.

14. The distributed data management system of claim 13, wherein the global data structure is divided into partitions that are each stored in a different database management node.

15. The distributed data management system of claim 13, further configured to hash a received key value identifying a data object, wherein a resulting hash value identifies a logical data store in which the data object is stored.

16. The distributed data management system of claim 13, wherein the at least one of the database management nodes maintaining the global data structure further maintains a cache comprising recently accessed data objects.

17. The distributed data management system of claim 16, further configured to, upon receiving a request for a value of a data object that is stored the cache, transmit the value to a database management node that stores a logical data store corresponding to the data object in order to confirm that the value of the data object stored in the cache is current.