System and method for returning results of a query from one or more slave nodes to one or more master nodes of a database system

• US 7,797,333 B1
• Filed: 06/11/2004
• Issued: 09/14/2010
• Est. Priority Date: 06/11/2004
• Status: Active Grant

• Current Assignee: LexisNexis Risk Data Management, Inc. (RELX PLC)
• Original Assignee: Seisint, Inc.
• Inventors: Bayliss, David A., Chapman, Richard K., Halliday, Gavin C., Poulsen, Ole D., Hicks, Nigel G., Cobbett-Smith, Jacob
• Primary Examiner(s): Jalil; Neveen Abel
• Assistant Examiner(s): Pulliam; Christyann R
• Application Number:
  US10/866,456
• Time in Patent Office: 2,286 Days
• Field of Search: 707/3
• US Class Current: 707/770
• CPC Class Codes: G06F 16/2471 Distributed queries

Abstract

A database system for processing a query request comprises a master node that communicates a request to perform one or more activities associated with a precompiled query over at least one communication channel. A plurality of slave nodes are coupled to the master node. At least a particular one of the slave node receives the request communicated by the master node, performs at least a portion of the one or more activities associated with the request to obtain one or more results for the request, communicates a request-to-send message to the master node indicating that the one or more results are available for communication to the master node, and communicates at least a portion of the one or more results to the master node in response to receiving a permission-to-send message from the master node.

Claims

1. A database system for processing a query request, comprising:

a first master node running on at least one first processor for;

communicating a request to perform one or more activities associated with a precompiled query over at least one communication channel of the database system,

receiving a request-to-send message from a first slave node on a flow control communication channel, wherein the flow control communication channel is accessible by a plurality of master nodes including the first master node and another master node,

listening, after receiving the request-to-send message, to the flow control communication channel for messages between the first slave node and the another master node to determine an availability of the first slave node at least based on whether or not the first slave node is currently sending results to the another master node,

communicating a permission-to-send message to the first slave node, if it is determined from the listening on the flow control communication channel that the first slave node is available because it is not currently sending results to the another master node, wherein the permission-to-send message is valid for a predefined period of time, and

communicating the permission-to-send message to a second slave node if it is determined from the listening on the flow control communication channel that the first slave node is unavailable because it is currently sending results to the another master node; and

a plurality of slave nodes running on at least one second processor coupled to the first master node, at least a particular one of the slave nodes for;

receiving over the communication channel the request communicated by the first master node;

performing at least a portion of the one or more activities associated with the request to obtain one or more results for the request;

communicating the request-to-send message to the first master node indicating that the one or more results are available for communication to the first master node; and

communicating at least a portion of the one or more results to the first master node in response to receiving the permission-to-send message from the first master node.

2. The system of claim 1, wherein the request comprises a request package comprising a transaction ID for uniquely identifying the request.

3. The system of claim 2, wherein the request package comprises an identification of the first master node that communicated the request package.

4. The system of claim 2, wherein each of the request-to-send and permission-to-send messages comprise the transaction ID of the request.

5. The system of claim 1, wherein the first master node communicates the permission-to-send message over the flow control communication channel accessible to one or more other master nodes.

6. The system of claim 1, wherein the first master node reinserts the request-to-send message in a queue if the results are not received by the master node within the predefined period of time, the queue storing request-to-send messages received by the first master node.

7. The system of claim 1, wherein the first master node:

receives at least a portion of the one or more results from the particular slave node; and

determines, based at least on a transaction ID associated with the one or more results, whether the one or more results are a duplicate of one or more other results received by the first master node; and

discards the results received from the particular slave node if the one or more results are determined to be a duplicate.

8. The system of claim 1, wherein the at least one of the plurality of slave nodes determines a size of the portion of the one or more results based on a maximum communication size specified in the permission-to-send message communicated by the first master node.

9. A method for processing a query request, comprising:

communicating from a first master node a request to perform one or more activities associated with a precompiled query over at least one communication channel of the database system;

receiving, at least at a particular one of a plurality of slave nodes coupled to the first master node, over the communication channel the request communicated by the first master node;

performing at the particular slave node at least a portion of the one or more activities associated with the request to obtain one or more results for the request;

communicating from the particular slave node a request-to-send message to the first master node on a flow control communication channel indicating that the one or more results are available for communication to the first master node, wherein the flow control communication channel is accessible by a plurality of master nodes including the first master node and another master node;

listening, after receiving the request-to-send message, to the flow control communication channel for messages between the first slave node and the another master node to determine, prior to communicating a permission-to-send message to the particular slave node, an availability of the first slave node at least based on whether or not the particular slave node is currently sending results to the another master node;

communicating the permission-to-send message to the particular slave node if it is determined from the listening on the flow control communication channel that the particular slave node is available because it is not currently sending results to the another master node, wherein the permission-to-send message is valid for a predefined period of time;

communicating the permission-to-send message to a different slave node if it is determined from the listening on the flow control communication channel that the particular slave node is not available because it is currently sending the results to the another master node; and

communicating from the particular slave node at least a portion of the one or more results to the first master node in response to receiving the permission-to-send message from the first master node.

10. The method of claim 9, wherein the request comprises a request package comprising a transaction ID for uniquely identifying the request.

11. The method of claim 10, wherein the request package comprises an identification of the first master node that communicated the request package.

12. The method of claim 10, wherein each of the request-to-send and permission-to-send messages comprise the transaction ID of the request.

13. The method of claim 9, comprising communicating the permission-to-send message over the flow control communication channel accessible to one or more other master nodes.

14. The method of claim 9, further comprising reinserting the request-to-send message in a queue if the results are not received by the first master node within the predefined period of time, the queue storing request-to-send messages received by the first master node.

15. The method of claim 9, further comprising:

receiving at the first master node at least a portion of the one or more results from the particular slave node;

determining at the first master node, based at least on a transaction ID associated with the one or more results, whether the one or more results are a duplicate of one or more other results received by the first master node; and

discarding at the first master node the one or more results received from the particular slave node if the one or more results are determined to be a duplicate.

16. The method of claim 9, further comprising determining, by the particular slave node, a size of the portion of the one or more results based on a maximum communication size specified in the permission-to-send message communicated by the first master node.

17. A computer-readable medium comprising program instructions, which, when executed by a processor, cause the processor to perform a method for processing a query request, the method comprising:

communicating from a first master node a request to perform one or more activities associated with a precompiled query over at least one communication channel of the database system;

receiving, at least at a particular one of a plurality of slave nodes coupled to the first master node, over the communication channel the request communicated by the first master node;

performing at the particular slave node at least a portion of the one or more activities associated with the request to obtain one or more results for the request;

communicating from the particular slave node a request-to-send message to the first master node on a flow control communication channel indicating that the one or more results are available for communication to the first master node, wherein the flow control communication channel is accessible by a plurality of master nodes including the first master node and another master node;

listening, after receiving the request-to-send message, to the flow control communication channel for messages between the first slave node and the another master node to determine, prior to communicating a permission-to-send message to the particular slave node, an availability of the first slave node at least based on whether or not the particular slave node is currently sending results to the another master node;

communicating the permission-to-send message to the particular slave node if it is determined from the listening on the flow control communication channel that the particular slave node is available because it is not currently sending results to the another master node, wherein the permission-to-send message is valid for a predefined period of time;

communicating the permission-to-send message to a different slave node if it is determined from the listening on the flow control communication channel that the particular slave node is not available because it is currently sending the results to the another master node; and

communicating from the particular slave node at least a portion of the one or more results to the first master node in response to receiving the permission-to-send message from the first master node.