REGISTERING DATA MODIFICATION LISTENER IN A DATA-GRID

• US 20160125014A1
• Filed: 01/29/2015
• Published: 05/05/2016
• 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
• Granted Patent: US 10,346,267 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• 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 ensuring consistency in mirrored systems G06F11/2064
• 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 node including a memory to store data of the node and a processor coupled to the memory. The processor can receive, from a listener in a data grid system, a filter defined by search criteria of a search query. The processor can also communicate, to the listener, data from the memory that is filtered using the filter. The processor can further identify changes to the filtered data. The processor can further record, into a queue, the changes to the filtered data in the memory after the filtered data is communicated to the listener. The processor can further communicate, to the listener, the queue of changes to the filtered data.

Claims

1. A node, comprising:

a memory to store data of the node;

a processor coupled to the memory, the processor to;

receive, from a listener in a data grid system, a filter defined by search criteria of a search query;

communicate, to the listener, data from the memory that is filtered using the filter;

identify changes to the filtered data;

record, the changes to the filtered data into a queue in the memory after the filtered data is communicated to the listener; and

communicate, to the listener, the queue of changes to the filtered data.

2. The node of claim 1, wherein the listener maintains a complete list of the changes to filtered data in the memory of the node.

3. The node of claim 1, wherein the changes to the filtered data comprise:

data written to the node in the data grid system and filtered by the filter;

or

the filtered data modified at the node in the data grid system.

4. The node of claim 1, wherein the processor is further to determine when the received filter has previously been installed or registered at the node.

5. The node of claim 1, wherein the processor is further to filter data in the memory that matches the filter from the listener.

6. A method comprising:

communicating, from a listener of a first node in a data grid, a filter to a second node in the data grid in response to receiving a data request from an application;

receiving, at the listener, data from the second node that is filtered using the filter;

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; and

combining, by a processing device executing the listener, the queued update information and the filtered data of the second node to generate a response to the data request from the application.

7. The method of claim 6, further comprising combining, by a processing device executing the listener, the queued update information to a list of the changes received from other nodes in a cluster of the data grid.

8. The method of claim 6, further comprising:

receiving, from the application, the listener; and

registering the listener at the first node.

9. The method of claim 6, further comprising communicating, from the listener of the first node in the data grid system, a projector to a second node in the data grid system, wherein the filter selects a subset of data in a memory of the second node and the projector extracts information from the subset of data.

10. The method of claim 6, wherein the update information comprises a queue of changes to the filtered data at the second node.

12. The method of claim 6, wherein the queued update information comprises:

an indication of data that is written to the second node and is filtered using the filter; and

an indication of filtered data that is modified at the second node after the filtered data is received at the listener.

13. The method of claim 6, further comprising communicating the filter to a plurality of nodes in the data grid system.

11. The method of claim 11, wherein the update information is a queue of changes to the filtered data after the filtered data is received at the listener.

14. A non-transitory computer-readable storage medium, having instructions stored therein, which when executed, cause a processing device to execute operations comprising:

receive, from a listener in a data grid system, a filter defined by search criteria of a search query;

communicate, to the listener, data from a memory that is filtered using the filter;

identify changes to the filtered data;

record, by the processing device, the changes to the filtered data into a queue in a memory after the filtered data is iterated over; and

communicate, to the listener, the queue of changes to the filtered data.

15. The non-transitory computer-readable storage medium of claim 14, the operations further comprising receive, from the listener, a projector, wherein the filter selects a subset of data in the memory of the processing device and the projector extracts information from the subset of data.

16. The non-transitory computer-readable storage medium of claim 14, wherein the changes to the filtered data occur after the filtered data is communicated to the listener.

17. The non-transitory computer-readable storage medium of claim 14, the operations further comprising determining when the filter has been received from another node in a cluster of the data grid.

18. The non-transitory computer-readable storage medium of claim 14, the operations further comprising receiving from an application a modification to the memory, wherein the modification can be an entry of data in the memory, a change of data in the memory, or a deletion of data in the memory.

19. The non-transitory computer-readable storage medium of claim 14, wherein:

the queue of changes to the filtered data is communicated at the same time as the filtered data or in a single message;

or

the queue of changes to the filtered data is communicated after the filtered data is communicated.

20. The non-transitory computer-readable storage medium of claim 14, wherein the listener maintains a complete list of the changes to filtered data in the memory of the node.