System and method for improving load balancing in large database management system

1. A method for load balancing in a database management system comprises:

receiving a message by a first intermediate node of a plurality of nodes, wherein the first intermediate node is limited to communication with a subset of nodes of the plurality of nodes, wherein the message includes data that is being sent in accordance with a routing path from a source node of the plurality of nodes to a destination node of the plurality of nodes, is a first size, and indicates a next node of the routing path, and wherein the subset of nodes includes the next node; and

processing, by the first intermediate node, the message by: generating a revised message, wherein the revised message includes the data and has a second size; determining, based on the message, whether there is at least one additional intermediate node after the next node in the routing path;

when there is at least one additional intermediate node:

determining an optimal route for forwarding the revised message to the additional intermediate node via a node of the subset of nodes; and

sending the revised message to the node in accordance with the optimal route;

maintaining, by the first intermediate node, a tracking table that indicates a total amount of data sent to each node of the subset of nodes during a first time period; and

resetting the total amount of data sent to each node of the subset of nodes to zero based on one or more of a command and an initiation of a second time period.

2. The method of claim 1 further comprises:

when the resetting is based on the initiation of the second time period:

maintaining, by the first intermediate node, the tracking table that indicates the total amount of data sent to each of the subset of nodes during the second time period.

3. The method of claim 1 further comprises:

updating, by the first intermediate node, an entry of the tracking table associated with the node to produce an updated total amount of data sent to the node, wherein the updated total amount includes the second size added to the total amount.

4. The method of claim 1 : wherein the determining the optimal route comprises:

determining the total amount of data for each node of the subset of nodes; and

selecting the node from the subset of nodes when the total amount of data for the node is less than the total amount of data for other nodes of the subset of nodes.

5. The method of claim 1 , wherein the message further comprises:

an indication of a number of intermediate nodes between the next node and the destination node, wherein the intermediate nodes include the next node; and an identifier of each of the intermediate nodes.

6. The method of claim 5 , wherein the determining whether there is at least one additional intermediate node after the next node in the routing path comprises one of:

determining whether the number is greater than or equal to two; and

determining whether there is two or more or identifiers of the intermediated nodes in the message.

7. The method of claim 5 , wherein the generating the revised message comprises:

lowering the indication of the number by one; and

removing an identifier associated with the next node, wherein the second size is equal to the first size minus a size of the identifier.

8. The method of claim 1 , wherein the limit to the communication with the subset of nodes is based on a connecting node formula, and wherein the connecting node formula is based on the plurality of nodes being arranged as a variable density binomial graph network within the database management system.

9. A computer readable memory comprises:

one or more memory sections for storing operational instructions that, when executed by a first intermediate node of a plurality of nodes of a database management system, cause the first intermediate node to:

receive a message, wherein the first intermediate node is limited to communication with a subset of nodes of the plurality of nodes, wherein the message: includes data that is being sent in accordance with a routing path from a source node of the plurality of nodes to a destination node of the plurality of nodes, is a first size, and indicates a next node of the routing path, and wherein the subset of nodes includes the next node; and

process the message by:

generating a revised message, wherein the revised message includes the data and has a second size;

determining, based on the message, whether there is at least one additional intermediate node after the next node in the routing path;

when there is at least one additional intermediate node:

determining an optimal route for forwarding the revised message to the additional intermediate node via a node of the subset of nodes; and

sending the revised message to the node in accordance with the optimal route;

maintaining, by the first intermediate node, a tracking table that indicates a total amount of data sent to each node of the subset of nodes during a first time period; and

resetting the total amount of data sent to each node of the subset of nodes to zero based on one or more of a command and an initiation of a second time period.

10. The computer readable memory of claim 9 , wherein the one or more memory sections store further operational instructions that, when executed by the first intermediate node, cause the first intermediate node to:

when the resetting is based on the initiation of the second time period:

maintain the tracking table that indicates the total amount of data sent to each of the subset of nodes during the second time period.

11. The computer readable memory of claim 9 , wherein the one or more memory sections store further operational instructions that, when executed by the first intermediate node, cause the first intermediate node to:

update an entry of the tracking table associated with the node to produce an updated total amount of data sent to the node, wherein the updated total amount includes the second size added to the total amount.

12. The computer readable memory of claim 9 , wherein the one or more memory sections store further operational instructions that, when executed by the first intermediate node, cause the first intermediate node to determining the optimal route by:

determining the total amount of data for each node of the subset of nodes; and

selecting the node from the subset of nodes when the total amount of data for the node is less than the total amount of data for other nodes of the subset of nodes.

13. The computer readable memory of claim 9 , wherein the one or more memory sections store further operational instructions that, when executed by the first intermediate node, cause the first intermediate node to interpret the message to determine:

an indication of a number of intermediate nodes between the next node and the destination node, wherein the intermediate nodes include the next node; and

an identifier of each of the intermediate nodes.

14. The computer readable memory of claim 13 , wherein the one or more memory sections store further operational instructions that, when executed by the first intermediate node, cause the first intermediate node to determine whether there is at least one additional intermediate node after the next node in the routing path by one of:

determining whether the number is greater than or equal to two; and

determining whether there is two or more or identifiers of the intermediated nodes in the message.

15. The computer readable memory of claim 13 , wherein the one or more memory sections store further operational instructions that, when executed by the first intermediate node, cause the first intermediate node to generate the revised message by:

lowering the indication of the number by one; and

removing an identifier associated with the next node, wherein the second size is equal to the first size minus a size of the identifier.

16. The computer readable memory of claim 9 , wherein the one or more memory sections store further operational instructions that, when executed by the first intermediate node, cause the first intermediate node to determine the subset of nodes based on a connecting node formula, and wherein the connecting node formula is based on the plurality of nodes being arranged as a variable density binomial graph network within the database management system.