PARTITIONING DATABASE DATA IN A SHARDED DATABASE

• US 20140108421A1
• Filed: 10/04/2013
• Published: 04/17/2014
• Est. Priority Date: 10/04/2012
• Status: Abandoned Application

• Current Assignee: CodeFutures Corporation
• Original Assignee: CodeFutures Corporation
• Inventors: Isaacson, Cory M., Grove, Andrew F.
• Application Number:
  US14/046,875
• Publication Number:
  US 20140108421A1
• Time in Patent Office: Days
• US Class Current: 707/747
• CPC Class Codes: G06F 16/2255 Hash tables
• 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 sharded database system configured for partitioning data amongst a plurality of shard servers is provided. In one implementation the sharded database system comprises a sharded database including a first shard server, a second shard server, and a shard control record. The shard control record is configured to define a first data structure for distributing a first plurality of data records or rows based on a first sharding by monotonic key range across the first and second shard servers. The sharded database is also configured to further distribute the first plurality of records or rows across the first shard server and the second shard server via a subsidiary hashing method. A method of partitioning data of a database is also provided.

Claims

1. A sharded database system configured for partitioning data amongst a plurality of shard servers, the system comprising:

a sharded database comprising a first shard server, a second shard server, and a shard control record configured to define a first data structure for distributing a first plurality of data records or rows based on a first sharding by monotonic key range across the first and second shard servers, wherein the sharded database is configured to further distribute the first plurality of records or rows across the first shard server and the second shard server via a subsidiary hashing method.

2. The sharded database system of claim 1 wherein the first sharding is based on a shard tree.

3. The sharded database system of claim 2 wherein the shard tree comprises a root shard table.

4. The sharded database system of claim 3 wherein the root shard table comprises a parent of the shard tree.

5. The sharded database system of claim 2 wherein the shard tree comprises application specific data relationships.

6. The sharded database system of claim 5 wherein the data relationships are discovered via an automated tool.

7. The sharded database system of claim 5 wherein the data relationships are specified by an application developer.

8. The sharded database system of claim 1 wherein the sharded database comprises a shard index.

9. The sharded database system of claim 8 wherein the sharded database is configured to determine a shard key using the shard index.

10. The sharded database system of claim 9 wherein the sharded database is configured to determine the shard key for a grandchild table using the shard index.

11. The sharded database system of claim 1 wherein the subsidiary hashing method comprises modulus hashing.

12. The sharded database system of claim 1 wherein the subsidiary hashing method comprises consistent hashing.

13. A method of partitioning data of a database, the method comprising:

defining a first shard control record for a first shard server and a second shard server of a database, the first shard control record defining a first data structure for distributing a first plurality of data records or rows based on a first sharding by monotonic key range across the first and second shard servers;

distributing records or rows within the first and second shard servers via a subsidiary hashing method;

adding a third shard server after the first plurality of data records or rows are added to the first and second shard servers of the database; and

updating the shard control record to define a second data structure for distributing a second plurality of data records or rows based on a second sharding by monotonic key range across the first, second and third shard servers.

14. The method of claim 13 further comprising distributing records or rows within the first, second and third shard servers via the subsidiary hashing method after the operation of updating the shard control record to define a second data structure for distributing a second plurality of data records or rows.

15. The method of claim 13 further comprising updating the shard control record to define a third data structure for distributing a third plurality of data records or rows across the second and third shard servers.

16. The method of claim 15 wherein the operation of updating the shard control record to define the third data structure restricts new data records or rows from being stored in the first shard server.

17. The method of claim 13 wherein the subsidiary hashing method comprises modulus hashing.

18. The method of claim 13 wherein the subsidiary hashing method comprises consistent hashing.

19. The method of claim 13 wherein the plurality of data records or rows comprises a plurality of relational data rows.