DATA DISTRIBUTION ACROSS NODES OF A DISTRIBUTED DATABASE BASE SYSTEM
A method of a data distribution across nodes of a Distributed Database Base System (DDBS) includes the step of hashing a primary key of a record into a digest, wherein the digest is part of a digest space of the DDBS. The method includes the step of partitioning the digest space of the DDBS into a set of non-overlapping partitions. The method includes the step of implementing a partition assignment algorithm. The partition assignment algorithm includes the step of generating a replication list for the set of non-overlapping partitions. The replication list includes a permutation of a cluster succession list. A first node in the replication list comprises a master node for that partition. A second node in the replication list comprises a first replica. The partition assignment algorithm includes the step using the replication list to generate a partition map.
1 . A method of a data distribution across nodes of a Distributed Database Base System (DDBS) comprising:
hashing a primary key of a record into a digest, wherein the digest is part of a digest space of the DDBS;
partitioning the digest space of the DDBS into a set of non-overlapping partitions;
implementing a partition assignment algorithm, wherein the partition assignment algorithm:
generating a replication list for the set of non-overlapping partitions;
wherein the replication list comprises a permutation of a cluster succession list,
wherein a first node in the replication list comprises a master node for that partition, and
wherein a second node in the replication list comprises a first replica, and
using the replication list to generate a partition map.
2 . The method of claim 1 , wherein the RIPEMD (RACE Integrity Primitives Evaluation Message Digest).
3 . The method of claim 1 , wherein the digest comprises a one-hundred and sixty (160) byte digest.
4 . The method of claim 3 , wherein the non-overlapping partition comprises a set of four-thousand and ninety-six (4096) non-overlapping partitions.
5 . The method of claim 4 , wherein each non-overlapping partition is a smallest unit of ownership of data in in the DDBS.
6 . The method of claim 6 , wherein a distribution of primary keys in the digest space is uniform.
7 . The method of claim 6 , wherein the DDBS collocates set of indexes and a set of related data.
8 . The method of claim 7 ,
wherein only one master node is extant in the DDBS for a partition,
wherein all write operation traffic is directed toward the master node.
9 . The method of claim 7 , wherein read operation traffic is spread across a set of replicas indicated in the replication list via a runtime configuration, and wherein the DDBS supports specified number of replicas from one to as many nodes in a cluster.
10 . A computerized system of data distribution across a set of nodes of a Distributed Database Base System (DDBS) comprising:
a processor configured to execute instructions;
a memory including instructions when executed on the processor, causes the processor to perform operations that:
hashes a primary key of a record into a digest, wherein the digest is part of a digest space of the DDBS;
partitions the digest space of the DDBS into a set of non-overlapping partitions;
implements a partition assignment algorithm, wherein the partition assignment algorithm:
generates a replication list for the set of non-overlapping partitions;
wherein the replication list comprises a permutation of a cluster succession list,
wherein a first node in the replication list comprises a master node for that partition, and
wherein a second node in the replication list comprises a first replica, and
uses the replication list to generate a partition map.
11 . The computerized system of claim 10 , wherein the RIPEMD (RACE Integrity Primitives Evaluation Message Digest).
12 . The computerized system of claim 10 , wherein the digest comprises a one-hundred and sixty (160) byte digest.
13 . The computerized system of claim 12 , wherein the non-overlapping partitions comprises a set of four-thousand and ninety-six (4096) non-overlapping partitions.
14 . The computerized system of claim 13 , wherein each non-overlapping partition is a smallest unit of ownership of data in in the DDBS.
15 . The computerized system of claim 14 , wherein a distribution of primary keys in the digest space is uniform.
16 . The computerized system of claim 15 , wherein the DDBS collocates a set of indexes and a set of related data.
17 . The computerized system of claim 16 , wherein only one master node is extant in the DDBS for a partition,
18 . The computerized system of claim 16 , wherein all write operation traffic is directed toward the master node.
19 . The computerized system of claim 16 , wherein read operation traffic is spread across a set of replicas indicated in the replication list via a runtime configuration.
20 . The computerized system of claim 16 , wherein the DDBS supports a specified number of replicas from one to as many nodes in a cluster.