Utilizing a prioritized feedback communication mechanism based on backlog detection data

Patent metadata

Field	Value
Publication number	US-11893017-B2
Application number	US-202318163457-A
Country	US
Kind code	B2
Filing date	Feb 2, 2023
Priority date	Mar 25, 2020
Publication date	Feb 6, 2024
Grant date	Feb 6, 2024

Abstract

A node of a database system is operable to receive a plurality of data blocks. Based on backlog detection data, at least one feedback data block is generated to be sent to the set of source nodes. Feedback relay node selection data selecting at least one of the plurality of nodes in the database system for facilitating routing of the at least one feedback data block from the node to at least one of the set of source nodes via a prioritized feedback communication mechanism is generated. The at least one feedback data block is sent to the at least one of the plurality of nodes selected in the feedback relay node selection data. The at least one of the plurality of nodes facilitates routing of the at least one feedback data block from the node via the prioritized feedback communication mechanism.

First claim

What is claimed is:

1. A method for execution by a node of a database system, comprising:
receiving a plurality of data blocks from a set of source nodes via a set of relay nodes;
generating backlog detection data based on a current data input rate of the plurality of data blocks comparing unfavorably to a backlog threshold condition;
generating at least one feedback data block based on the backlog detection data to be sent to the set of source nodes;
generating feedback relay node selection data selecting at least one of a plurality of nodes in the database system for facilitating routing of the at least one feedback data block from the node to at least one of the set of source nodes via a prioritized feedback communication mechanism; and
sending the at least one feedback data block to the at least one of the plurality of nodes selected in the feedback relay node selection data, wherein the at least one of the plurality of nodes facilitates routing of the at least one feedback data block from the node to the at least one of the set of source nodes via the prioritized feedback communication mechanism.

2. The method of claim 1 , wherein the plurality of data blocks are received from the set of source nodes via the set of relay nodes in accordance with execution of a query by a plurality of nodes of the database system.

3. The method of claim 1 , wherein a subset of the plurality of data blocks are received from one source node of the set of source nodes via a first set of relay nodes, wherein the routing via the prioritized feedback communication mechanism includes routing via a second set of relay nodes of the of the database system, wherein a set difference between the first set of relay nodes and the second set of relay nodes is non-null.

4. The method of claim 3 , wherein the prioritized feedback communication mechanism includes routing via the second set of relay nodes based on the second set of relay nodes including fewer relay nodes from the first set of relay nodes.

5. The method of claim 3 , wherein the second set of relay nodes and the first set of relay nodes have a non-null intersection.

6. The method of claim 3 , wherein the second set of relay nodes and the first set of relay nodes have a null intersection.

7. The method of claim 3 , further comprising:
determining normal initial route data for each of a plurality of other nodes;
determining priority initial route data for each of the plurality of other nodes;
storing the normal initial route data and the priority initial route data in memory resources prior to generating the backlog detection data; and
accessing the priority initial route data for one of the plurality of other nodes that corresponds to the source node, wherein the second set of relay nodes implementing the prioritized feedback communication mechanism is based on the priority initial route data for the one of the plurality of other nodes that corresponds to the source node.

8. The method of claim 1 , wherein the at least one of the plurality of nodes facilitates the routing of the at least one feedback data block from the node to the at least one of the set of source nodes via the prioritized feedback communication mechanism based on a given node in the at least one of the plurality of nodes executing steps that include:
receiving a plurality of other data blocks to be sent to at least one other node;
maintaining a queue of the other data blocks;
receiving the at least one feedback data block from the node after receiving the plurality of other data blocks; and
sending the at least one feedback data block to at least one other relay node prior to sending the plurality of other data blocks to the at least one other node based on applying the prioritized feedback communication mechanism.

9. The method of claim 1 , wherein the at least one of the plurality of nodes facilitates the routing of the at least one feedback data block from the node to the at least one of the set of source nodes via the prioritized feedback communication mechanism based on a given node in the at least one of the plurality of nodes executing steps that include:
selecting a selected intermediate node in intermediate node selection data, based on the prioritized feedback communication mechanism, for routing of the at least one feedback data block to a corresponding destination node via sending of the at least one feedback data block to the selected intermediate node, wherein the corresponding destination node is one of: one of the set of source nodes, or one of the set of relay nodes.

10. The method of claim 1 , wherein the set of source nodes includes a plurality of source nodes.

11. The method of claim 10 , wherein the at least one of the set of source nodes includes only a proper subset of source nodes of the set of source nodes.

12. The method of claim 10 , wherein the routing via the prioritized feedback communication mechanism includes:
routing the at least one feedback data block to a first source node via a first set of relay nodes; and
routing the at least one feedback data block to a second source node via a second set of relay nodes.

13. The method of claim 12 , wherein a set difference between the first set of relay nodes and the second set of relay nodes is non-null.

14. The method of claim 1 , wherein at least one of:
the backlog threshold condition is based on a maximum threshold input rate, wherein the backlog detection data is generated based on the current data input rate of the plurality of data blocks comparing unfavorably to the maximum threshold input rate;
the backlog threshold condition is based on a maximum utilization level, wherein the backlog detection data is generated based on a current utilization level of the node comparing unfavorably to the maximum utilization level, and wherein the current utilization level is based on at least one of: utilization due to the current data input rate of the plurality of data blocks, utilization due to processing of the plurality of data blocks via a query processing module of the node, or utilization due to routing of the plurality of data blocks via a data block routing module of the node;
the backlog threshold condition is based on a maximum data queue size, where the backlog detection data is generated based on a current data queue size of a data queue of the node comparing unfavorably to the maximum data queue size, and wherein the plurality of data blocks are added to the data queue of the node while they are pending at least one of: processing by the node or relaying by the node; or
the backlog threshold condition is based on a required performance level, wherein the backlog detection data is generated based on a current performance level of the node comparing unfavorably to the required performance level.

15. The method of claim 1 , wherein the at least one feedback data block indicates an instruction to one of: reduce routing of data blocks, or stop routing of data blocks.

16. The method of claim 15 , wherein the instruction is processed by at least one of:
at least one of the set of source nodes based on the at least one feedback data block being routed to the a least one of source node via the prioritized feedback communication mechanism; or
at least one relay node implementing the prioritized feedback communication mechanism for routing the at least one feedback data block to the set of source nodes based on receiving the at least one feedback data block in accordance with the prioritized feedback communication mechanism, wherein the instruction indicated by the at least one feedback data block is proc

Assignees

• Ocient Holdings LLC

Inventors

• Kondiles George
• Arnold Jason
• Gladwin S Christopher
• Jablonski Joseph
• Coombs Daniel
• Baptist Andrew D

Classifications

• H04L45/02

  Topology update or discovery · CPC title

• G06F16/24542 Primary

  Plan optimisation · CPC title

• G06F16/24532 Primary

  of parallel queries · CPC title

• G06F16/2455

  Query execution · CPC title

• G06F16/2471

  Distributed queries · CPC title