Non-blocking listener registration in the presence of data grid nodes joining the cluster
First Claim
Patent Images
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, operatively coupled to the memory, the processing device to execute a listener 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; and
communicate the filter to the third node in response to the third node joining the cluster.
1 Assignment
0 Petitions
Accused Products
Abstract
A method of communicating data in a node cluster of a data grid is described. 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.
-
Citations
20 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, operatively coupled to the memory, the processing device to execute a listener 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; and communicate the filter to the third node in response to the third node joining the cluster. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A first node, comprising:
-
a memory to store data of the first node; and a processing device operatively coupled to the memory, the processing device to; send registration information to a second node in response to joining a node cluster of a data grid; receive, from the second node, a filter defined by search criteria of a search query for data in the node cluster; receive data to enter into the memory 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 second node, the data from the memory when the data matches the filter. - View Dependent Claims (12, 13, 14, 15, 16, 17)
-
-
18. A method comprising:
-
receiving, at a first node, data from a second node that is filtered using a filter during a search query of a node cluster, wherein the filter is defined by search criteria of a search query; receiving, at the first node, 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 first node, that a third node has joined the node cluster during the search query; and communicating the filter to the third node joining the node cluster in response to the third node joining the cluster. - View Dependent Claims (19, 20)
-
Specification