Non-blocking listener registration in the presence of data grid nodes joining the cluster

• US 9,892,006 B2
• Filed: 01/29/2015
• Issued: 02/13/2018
• Est. Priority Date: 10/31/2014
• Status: Active Grant

• Current Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Original Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Inventors: Markus, Mircea, Burns, William Rosenquist
• Primary Examiner(s): Daye, Chelcie
• Application Number:
  US14/609,315
• Publication Number:
  US 20160125086A1
• Time in Patent Office: 1,111 Days
• Field of Search: 707722
• CPC Class Codes: G06F 11/00 Error detection; Error correction; Monitoring error detection, correction or monitoring in information storage based on relative movement between record carrier and transducer G11B20/18; monitoring, i.e. supervising the progress of recording or reproducing G11B27/36; in static stores G11C29/00
• CPC Class Codes: G06F 11/0709 in a distributed system consisting of a plurality of standalone computer nodes, e.g. clusters, client-server systems
• CPC Class Codes: G06F 11/0757 by exceeding a time limit, i.e. time-out, e.g. watchdogs
• CPC Class Codes: G06F 11/1658 Data re-synchronization of a redundant component, or initial sync of replacement, additional or spare unit
• CPC Class Codes: G06F 11/1662 the resynchronized component or unit being a persistent storage device re-synchronization of failed mirror storage G06F11/2082; rebuild or reconstruction of parity RAID storage G06F11/1008
• CPC Class Codes: G06F 11/2025 using centralised failover control functionality
• CPC Class Codes: G06F 11/2035 without idle spare hardware
• CPC Class Codes: G06F 11/2043 where the redundant components share a common memory address space
• CPC Class Codes: G06F 16/2255 Hash tables
• CPC Class Codes: G06F 16/2282 Tablespace storage structures; Management thereof
• CPC Class Codes: G06F 16/2291 User-Defined Types; Storage management thereof
• CPC Class Codes: G06F 16/2358 Change logging, detection, and notification replication G06F16/27
• CPC Class Codes: G06F 16/2379 Updates performed during online database operations; commit processing
• CPC Class Codes: G06F 16/2455 Query execution
• CPC Class Codes: G06F 16/24575 using context
• CPC Class Codes: G06F 16/285 Clustering or classification
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: G06F 2201/805 Real-time
• CPC Class Codes: G06F 2201/82 Solving problems relating to consistency
• CPC Class Codes: G06Q 20/102 Bill distribution or payments
• CPC Class Codes: G06Q 20/4016 : involving fraud or risk level assessment in transaction processing
• CPC Class Codes: G06Q 40/02 : Banking, e.g. interest calculation or account maintenance credit or loans G06Q40/03

Abstract

A method of communicating data in a node cluster of a data grid. The method includes receiving, at a listener of a first node, data from a second node that is filtered using the filter during a search query of a node cluster. The method further includes determining, at the listener, that a third node has joined the node cluster during the search query. The method further includes communicating the filter the third node joining the node cluster in response to the third node joining the cluster. The method further includes receiving memory entry data from the third node. The method further includes determining, at the listener, search results using the filtered data and queued data from the second node and the memory entry data from the from the third node.

Claims

1. A first node, comprising:

a memory to store data of the first node within a node cluster of a data grid;

a processing device coupled to the memory; and

a listener, executed from the memory by the processing device, to;

receive, from a second node, data that is filtered using a filter during a search query of the node cluster, wherein the filter is defined by search criteria of a search query;

receive queued update information from the second node, wherein the queued update information comprises information of changes to the filtered data maintained in a queue at the second node during the search query;

determine that a third node has joined the node cluster during the search query;

communicate the filter to the third node in response to the third node joining the cluster;

receive memory entry data from the third node, wherein;

the memory entry data comprises data received from an application, and

the memory entry data is filtered using the filter; and

determine search results using the filtered data and queued update information from the second node and the memory entry data from the third node.

2. The first node of claim 1, wherein the listener is further to receive memory modification data from the third node, wherein:

the memory entry data comprises memory modification data forwarded from the second node, and

the memory entry data is filtered using the filter.

3. The first node of claim 2, wherein the second node forwards the memory entry data to the third node when a memory level of the second node exceeds a threshold capacity level.

4. The first node of claim 1, wherein the listener is further to:

receive registration information from the third node in response to the third node joining the node cluster during the search query; and

determine that the third node has joined the node cluster based on the registration information.

5. The first node of claim 4, wherein the registration information is topology information indicating that the third node has joined the node cluster.

6. The first node of claim 4, wherein the listener is further to update topology information of the node cluster to include the third node using the registration information.

7. The first node of claim 4, wherein the processor is further to:

update topology information of a consistent hashing function using the registration information; and

transfer data, from the memory of the first node, to the second node or another node in the node cluster using the consistent hashing function.

8. The first node of claim 1, wherein the listener is further to:

maintain a list of the filtered data, the queued update information, and the memory entry data; and

determine search results using the list.

9. The first node of claim 1, wherein the listener is further to communicate, to the second node, the filter defined by search criteria of a search query.

10. The first node of claim 1, wherein the processing device is to:

receive, from another application, the listener; and

register the listener at the first node.

11. A first node, comprising:

a memory to store data of the first node;

a processing device coupled to the memory, the processing device to;

join a node cluster of a data grid during a search query for data in the node cluster;

send registration information to a second node in response to joining the node cluster;

receive, from a listener of the second node, a filter defined by search criteria of the search query;

receive data to enter into the memory from an application in response to a memory capacity level of a third node in the node cluster exceeding a threshold memory capacity level;

determine when the data matches the filter; and

communicate, to the listener, the data from the memory when the data matches the filter.

12. The first node of claim 11, wherein the registration information is topology information indicating that the first node has joined the node cluster during the search query.

13. The first node of claim 12, wherein the registration information comprises topology update information to enable the second node to update topology information of the node cluster to include the first node.

14. The first node of claim 11, wherein the join, send, receive, and communicate occur during an iteration period of the search query.

15. The first node of claim 11, wherein the processing device is further to join the node cluster by:

sending a join cluster request to a cluster manager of the node cluster requesting to join the node cluster; and

receiving, from the cluster manager, an acceptance message in response to the join cluster request, wherein the acceptance message indicates that the first node is authorized the node cluster.

16. The first node of claim 11, wherein the processing device is further to receive data forwarded from the second node or another node in the node cluster in response to a memory level of the second node or the other node exceeding a threshold capacity level.

17. The first node of claim 16, wherein the processor is further to receive data stored at the second node or the other node after the search query has completed.

18. A method comprising:

receiving, at a listener of a first node, data from a second node that is filtered using the filter during a search query of a node cluster, wherein the filter is defined by search criteria of a search query;

receiving, at the listener, queued update information from the second node, wherein the queued update information comprises information of changes to the filtered data maintained in a queue at the second node during the search query;

determining, at the listener, that a third node has joined the node cluster during the search query;

communicating the filter to the third node joining the node cluster in response to the third node joining the cluster;

receiving memory entry data from the third node, wherein;

the memory entry data comprises data forwarded from the second node, and

the memory entry data is filtered using the filter; and

determining, at the listener, search results using the filtered data and queued data from the second node and the memory entry data from the third node.

19. The method of claim 18, wherein the method further comprises:

receiving, at the listener, data from a fourth node that is filtered using the filter; and

receiving queued update information from the fourth node, wherein the queued update information comprises information of changes to filtered data maintained in a queue at a second node during the search query.

20. The method of claim 18, wherein the receiving, communicating, and determining occur during an iteration period of the search query.

21. The method of claim 18, wherein the second node forwards the memory entry data to the third node when a memory level of the second node exceeds a threshold capacity level.

22. The method of claim 18, wherein the method further comprises:

maintaining a list of the filtered data, the queued update information, and the memory entry data; and

determining search results using the list.