System and method for processing a request to perform an activity associated with a precompiled query

• US 7,406,461 B1
• Filed: 06/11/2004
• Issued: 07/29/2008
• Est. Priority Date: 06/11/2004
• Status: Active Grant

• Current Assignee: LexisNexis Risk Data Management, Inc. (RELX PLC)
• Original Assignee: Seisint, Inc.
• Inventors: Halliday, Gavin C., Poulsen, Ole D., Bayliss, David A., Hicks, Nigel G., Cobbett-Smith, Jacob, Chapman, Richard K.
• Primary Examiner(s): Lu; Kuen S.
• Application Number:
  US10/866,565
• Time in Patent Office: 1,509 Days
• Field of Search: 707/3, 707/10
• US Class Current: 1/1
• CPC Class Codes: G06F 16/245 Query processing
• CPC Class Codes: G06F 16/3331 Query processing
• CPC Class Codes: G06F 16/90335 Query processing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

Abstract

In certain embodiments, a database system for processing a query request comprises at least one master node operable to communicate a request over a communication channel, the request comprising a request to perform an activity associated with a precompiled query. The system further includes a first slave node and a second slave node each coupled to the at least one master node, each of the first and second slave nodes operable to receive the request on the communication channel. The first slave node is further operable to communicate a first notification over the communication channel indicating that the first slave node is handling the request, and the second slave node is operable to receive the first notification communicated over the communication channel indicating that the first slave node is handling the request.

Claims

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

at least one master node that communicates a request over a communication channel,

the request comprising a request to perform an activity associated with a precompiled query;

a first slave node and a second slave node each coupled to the at least one master node, each of the first and second slave nodes receiving the request over the communication channel;

wherein the first slave node communicates a first notification over the communication channel indicating that the first slave node is processing the request,

the second slave node receives the first notification;

the second slave node communicates a second notification over the communication channel indicating that the second slave node is processing the request;

the first slave node receives the second notification;

the first or second slave node initiates an arbitration to determine whether the first or second slave node is entitled to process the request; and

a winner of the arbitration between the first and second slave nodes continues processing the request and a loser of the arbitration between the first and second slave nodes ceases processing the request.

2. The system of claim 1, further wherein:

if the loser of the arbitration has received one or more other requests from the same or a different master node that are waiting to be processed,

then the loser of the arbitration selects one of the one or more other requests to handle rather than the request received from the at least one master node; and

if the loser of the arbitration has not received one or more other requests from the same or a different master node that are waiting to be processed,

then the loser of the arbitration waits for a new request rather than processing the request received from the at least one master node.

3. The system of claim 1, wherein each of the first and second slave nodes comprise an incoming queue for storing requests received from one or more master nodes, the request received from the at least one master node being stored in the incoming queue.

4. The system of claim 3, wherein, prior to sending the first notification, the first slave node is operable to select a request from its incoming queue to handle by selecting one of a predetermined number of requests in the incoming queue at random.

5. The system of claim 1, wherein the activity comprises a request to perform an index read of one or more key parts of the database system, the first and second slave nodes having access to the one or more key parts.

6. The system of claim 1, wherein the request communicated by the master node comprises a request package, the request package comprising at least one activity ID identifying the activity associated with the precompiled query.

7. The system of claim 1, wherein the first notification comprises:

an activity ID identifying the activity associated with the request for which the first notification is being sent; and

a transaction ID identifying the request for which the first notification is being sent.

8. The system of claim 1, wherein:

the request comprises a multicast signal communicated on the communication channel; and

the first notification comprises a multicast signal communicated on the communication channel.

9. The system of claim 1, wherein the first and second slave nodes are two of a plurality of slave nodes coupled to the at least one master node, at least a third slave node being operable to receive the request over the communication channel.

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

receiving, at a first slave node and a second slave node, a request communicated over a communication channel by at least one master node,

each of the first and second slave nodes being coupled to the at least one master node,

the request comprising a request to perform an activity associated with a precompiled query;

communicating, from the first slave node, a first notification over the communication channel indicating that the first slave node is processing the request;

receiving, at the second slave node, the first notification;

communicating by the second slave node, a second notification over the communication channel indicating that the second slave node is handling the request;

receiving, at the first slave node, the second notification; and

initiating, at the first or second slave node, an arbitration to determine whether the first or second slave node is entitled to process the request,

wherein a winner of the arbitration between the first and second slave nodes continues processing the request and a loser of the arbitration between the first and second slave nodes ceases processing the request.

11. The method of claim 10, wherein:

if the loser of the arbitration has received one or more other requests from the same or a different master node that are waiting to be processed,

the loser of the arbitration selects one of the one or more other requests to handle rather than the request received from the at least one master node; and

if the loser of the arbitration has not received one or more other requests from the same or a different master node that are waiting to be processed,

the loser of the arbitration waits for a new request rather than processing the request received from the at least one master node.

12. The method of claim 10, further comprising storing, at each of the first and second slave nodes, requests received from one or more master nodes in an incoming queue of each of the first and second slave nodes, the request received from the at least one master node being stored in the incoming queue of each of the first and second slave nodes.

13. The method of claim 12, further comprising selecting, prior to sending the first notification, at the first slave node a request from the incoming queue of the first slave node by selecting one of a predetermined number of requests in the incoming queue at random.

14. The method of claim 10, wherein the activity comprises a request to perform an index read of one or more key parts of the database system, the first and second slave nodes having access to the one or more key parts.

15. The method of claim 10, wherein the request communicated by the master node comprises a request package, the request package comprising at least one activity ID identifying the activity associated with the precompiled query.

16. The method of claim 10, wherein the first notification comprises:

an activity ID identifying the activity associated with the request for which the first notification is being sent; and

a transaction ID identifying the request for which the first notification is being sent.

17. The method of claim 10, wherein:

the request comprises a multicast signal communicated on the communication channel; and

the first notification comprises a multicast signal communicated on the communication channel.

18. The method of claim 10, wherein:

the first and second slave nodes are two of a plurality of slave nodes coupled to the at least one master node; and

the method further comprises receiving, at least at a third slave node, the request communicated by the at least one master node over the communication channel.

19. A computer-readable medium storing program instructions for processing a query request according to a method, the method comprising:

receiving, at a first slave node and a second slave node, a request communicated over a communication channel by at least one master node,

each of the first and second slave nodes being coupled to the at least one master node,

the request comprising a request to perform an activity associated with a precompiled query;

communicating, from the first slave node, a first notification over the communication channel indicating that the first slave node is handling the request;

receiving, at the second slave node, the first notification;

communicating, by the second slave node, a second notification over the communication channel indicating that the second slave node is handling the request;

receiving, at the first slave node, the second notification; and

initiating, at the first or second slave node, an arbitration to determine whether the first or second slave node is entitled to process the request,

wherein a winner of the arbitration between the first and second slave nodes continues processing the request and a loser of the arbitration between the first and second slave nodes ceases processing the request.

20. The computer-readable medium of claim 19, wherein:

if the loser of the arbitration has received one or more other requests from the same or a different master node that are waiting to be processed,

the loser of the arbitration selects one of the one or more other requests to handle rather than the request received from the at least one master node; and

if the loser of the arbitration has not received one or more other requests from the same or a different master node that are waiting to be processed,

the loser of the arbitration waits for a new request rather than processing the request received from the at least one master node.