Aggregate failover for a distributed scale-out storage system
US-2024118981-A1 · Apr 11, 2024 · US
US2016125014A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2016125014-A1 |
| Application number | US-201514609333-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jan 29, 2015 |
| Priority date | Oct 31, 2014 |
| Publication date | May 5, 2016 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
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.
Opening claim text (preview).
What is claimed is: 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. 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. 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. 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.
using centralised failover control functionality · CPC title
where the redundant components share a common memory address space · CPC title
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 title
Change logging, detection, and notification (replication G06F16/27) · CPC title
Bill distribution or payments · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.