DATA COMMUNICATION IN A DISTRIBUTED DATA GRID

• US 20160253391A1
• Filed: 02/26/2015
• Published: 09/01/2016
• Est. Priority Date: 02/26/2015
• Status: Active Grant

• Current Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Original Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Inventors: Burns, William Rosenquist
• Granted Patent: US 10,572,486 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/156 Query results presentation
• CPC Class Codes: G06F 16/2455 Query execution
• CPC Class Codes: G06F 16/24564 Applying rules; Deductive queries
• CPC Class Codes: G06F 16/248 Presentation of query results
• CPC Class Codes: G06F 16/338 Presentation of query results
• CPC Class Codes: G06F 16/438 Presentation of query results
• CPC Class Codes: G06F 16/638 Presentation of query results
• CPC Class Codes: G06F 16/738 Presentation of query results
• CPC Class Codes: G06F 16/838 Presentation of query results
• CPC Class Codes: G06F 16/9038 Presentation of query results

Abstract

A method of communicating data in a data grid. The method includes receiving, from an iterator in a data grid, a search request to search for data matching search criteria in a first memory coupled to a node. The method further includes searching, by a processor of the node, for data in the memory matching the search criteria to obtain result data. The method further includes communicating, by the processor, the result data to the iterator. The method further includes pausing communicating the result data to the iterator in view of a pause condition pertaining to the memory capacity threshold of the second memory. The method further includes, in response to a resume condition, resuming communicating the result data to the iterator.

Claims

1. A first node, comprising:

a first memory coupled to the first node to store data of the first node, wherein the first node is a node within a data grid of nodes;

a processor coupled to the first memory, the processor to;

receive, from an iterator, a search request to search data in the first memory, wherein the search request comprises;

search criteria defined by a search query of the data grid; and

a memory capacity threshold of a second memory coupled to the iterator;

search, by the processor, for data in the first memory matching the search criteria to obtain result data;

communicate, to the iterator, the result data;

pause communicating the result data to the iterator in view of a pause condition pertaining to the memory capacity threshold of the second memory; and

in response to a resume condition, resume communicating the result data to the iterator.

2. The first node of claim 1, wherein the pause condition comprises communicating, by the first node, a threshold amount of result data to the iterator.

3. The first node of claim 1, wherein the pause condition comprises:

communicating, with other nodes in the data grid, to determine an amount of result data communicated by the first node and the other nodes to the iterator; and

determining when the amount of result data communicated by the first node and the other nodes is a threshold amount of data.

4. The first node of claim 1, wherein the pause condition comprises receiving, from the iterator, a pause message indicating to the first node to pause communicating result data to the iterator in view of the memory capacity threshold.

5. The first node of claim 1, wherein the resume condition comprises receiving, from the iterator, a resume message, wherein the resume message indicates to the first node to resume communicating result data to the iterator.

6. The first node of claim 1, wherein the search request further comprises a predetermined length of time for the first node to pause communicating result data when the pause condition occurs.

7. The first node of claim 6, wherein the resume condition comprises an expiration of the predetermined length of time.

8. An iterator, comprising:

a first memory coupled to the iterator to store data, wherein the iterator is coupled to a first node in a data grid;

a processor coupled to the first memory, the processor to;

communicate, to a second node in the data grid, a search request to search for data in a second memory of the second node, wherein the search request comprises;

search criteria defined by a search query from an application; and

a memory capacity threshold of the first memory;

receive, from the second node, result data of data in the second memory matching the search criteria; and

pause receiving the result data from the second node in view of a pause condition pertaining to the memory capacity threshold of the first memory.

9. The iterator of claim 8, wherein the processor is further to, in response to a resume condition, resume receiving the result data from the second node.

10. The iterator of claim 8, wherein the processor is further to receive, from the application, an iteration request, wherein the iteration request comprises the search criteria of the search query.

11. The iterator of claim 8, wherein the processor is further to communicate, to the first node in the data grid, a search request to search for data in a memory coupled to the first node to stored data.

12. The iterator of claim 8, wherein the pause condition comprises receiving, from the second node, a threshold amount of result data, wherein the threshold amount of result data is a memory capacity of the first memory.

13. The iterator of claim 8, wherein the processor is further to communicate, to the second node, a pause message indicating to the second node to pause communicating result data to the iterator in view of a memory capacity threshold.

14. The iterator of claim 8, wherein the processor is further to communicate, to the second node, a resume message indicating to the second node to resume receiving result data from the second node.

15. The iterator of claim 8, wherein the pause condition is a threshold length of time in view of a size of the first memory.

16. The iterator of claim 8, wherein the search request comprises a predetermined length of time for the second node to pause when a pause condition occurs.

17. The iterator of claim 8, wherein the processor is further to:

communicate, to a third node in the data grid, a search request to search for data in a third memory of the third node;

receive, from the third node, result data of data in the third memory matching the search criteria;

pause receiving the result data from the third node in view of a pause condition; and

resume receiving the result data from the third node in view of a resume condition.

18. A method, comprising:

receiving, from an iterator in a data grid, a search request to search for data matching search criteria in a first memory coupled to a node, wherein the search request comprises;

search criteria defined by a search query from an application; and

a memory capacity threshold of a second memory coupled to the iterator;

searching, by a processor of the node, for data in the memory matching the search criteria to obtain result data;

communicating, by the processor, the result data to the iterator;

pausing communicating the result data to the iterator in view of a pause condition pertaining to the memory capacity threshold of the second memory; and

in response to a resume condition, resuming communicating the result data to the iterator.

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

communicating, by the node, a threshold amount of result data to the iterator;

receiving, from the iterator, a pause message indicating to the node to pause communicating result data to the iterator;

or

communicating, with other nodes in the data grid, to determine an amount of result data communicated by the node and the other nodes to the iterator; and

determining when the amount of result data communicated to the iterator by the node and the other nodes is a threshold amount of result data.

20. The method of claim 18, wherein the resume condition comprises:

receiving, from the iterator, a resume message, wherein the resume message indicates to the node to resume communicating result data to the iterator;

or

an expiration of a predetermined length of time.