GRID TOPOLOGY CHANGE IN A DISTRIBUTED DATA GRID WHEN ITERATING ON THE CONTENTS OF THE DATA GRID

• US 20160253386A1
• 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,970,285 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2455 Query execution
• CPC Class Codes: G06F 16/9577 Optimising the visualization of content, e.g. distillation of HTML documents
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04L 67/125 involving control of end-device applications over a network
• CPC Class Codes: H04L 67/52 specially adapted for the location of the user terminal
• CPC Class Codes: H04L 67/565 Conversion or adaptation of application format or content adding application control or application functional data H04L67/561

Abstract

A method of communicating data in a data grid. The method includes receiving a first search request defined by search criteria of a search query. The method includes communicating the first search request to search for data segments at the first node that match the search criteria. The method includes receiving one or more data segments matching the search criteria. The method includes receiving rebalance information. The method further includes identifying a second node storing rebalance data segments of the plurality of rebalance data segments based on the rebalance information. The method further includes communicating a second search request to search for the rebalance data segments matching the search criteria. The method further includes receiving one or more rebalance data segments matching the search criteria. The method further includes determining search result data using the data segments from the first node and the rebalance data segments from the second node.

Claims

1. A non-transitory machine readable storage medium storing instructions which when executed cause a processing device to:

receive, from an application, a first search request defined by search criteria of a search query;

communicate, to a first node, the first search request to search for data segments at the first node that match the search criteria;

receive, from the first node, one or more data segments matching the search criteria;

receive, from a coordinator, rebalance information in response to the first node transferring a plurality of rebalance data segments to one or more nodes in the data grid, wherein the rebalance information identifies the one or more nodes storing the plurality of rebalance data segments;

identify, by the processing device, a second node storing rebalance data segments of the plurality of rebalance data segments based on the rebalance information, wherein the rebalance data segments are data segments transferred from the first node to the second node that match the search criteria and are not part of the data segments received from the first node;

communicate, to the second node, a second search request to search for the rebalance data segments matching the search criteria;

receive, from the second node, one or more rebalance data segments matching the search criteria; and

determine search result data using the data segments from the first node and the rebalance data segments from the second node.

2. The non-transitory machine-readable storage medium of claim 1, wherein the instructions further cause the processing device to receive, from a coordinator, data location information, wherein the data location information indicates where data is located at a plurality of nodes in the data grid.

3. The non-transitory machine-readable storage medium of claim 1, wherein the instructions further cause the processing device to communicate, to the application, the search results.

4. The non-transitory machine-readable storage medium of claim 1, wherein, to identify the second node, the instructions further cause the processing device to:

identify, by the processor, the data segments received from the first node matching the search criteria;

determine, by the processor, data segments not received from the first node; and

determine, by the processor, that the data segments not received from the first node are stored at the second node based on the rebalance information.

5. The non-transitory machine-readable storage medium of claim 1, wherein the receive, the communicate, the identify, and the determine occur during the search query.

6. The non-transitory machine-readable storage medium of claim 1, wherein the first node and the second node are in a data grid.

7. The non-transitory machine-readable storage medium of claim 6, wherein the rebalance data segments are transferred from the first node to the second node when the second node joins the data grid during the search query.

8. A method comprising:

receiving, from an application, a first search request defined by search criteria of a search query;

communicating, to a second node, the first search request to search for data segments at the first node that match the search criteria;

receiving, from the second node, one or more data segments matching the search criteria;

receiving, from a coordinator, rebalance information in response to the second node transferring a plurality of rebalance data segments to one or more nodes in the data grid, wherein the rebalance information identifies the one or more nodes storing the plurality of rebalance data segments;

identifying, by the processing device, a third node storing rebalance data segments of the plurality of rebalance data segments based on the rebalance information, wherein the rebalance data segments are data segments transferred from the second node to the third node that match the search criteria and are not part of the data segments received from the second node;

communicating, to the third node, a second search request to search for the rebalance data segments matching the search criteria;

receiving, from the third node, one or more rebalance data segments matching the search criteria; and

determining search result data using the data segments from the second node and the rebalance data segments from the third node.

9. The method of claim 8, further comprising receiving, from a coordinator, data location information, wherein the data location information indicates where data is located at a plurality of nodes in the data grid.

10. The method of claim 8, further comprising communicating, to the application, the search results.

11. The method of claim 8, wherein the identify the third node further comprises:

identifying, by the processor, the data segments received from the second node matching the search criteria;

determining, by the processor, data segments not received from the second node; and

determining, by the processor, that the data segments not received are stored at the third node based on the rebalance information.

12. The method of claim 8, wherein the receiving, the communicating, the identifying, and the determining occur during the search query.

13. The method of claim 8, wherein the first node, the second node, and the third node are in a data grid.

14. The method of claim 13, wherein the rebalance data segments are transferred from the second node to the third node when the third node joins the data grid during the search query.

15. A first node, comprising:

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

a processing device coupled to the memory; and

an iterator, executed from the memory by the processing device, to;

receive, from an application, a first search request defined by search criteria of a search query;

communicate, to a second node, the first search request to search for data segments at the first node that match the search criteria;

receive, from the second node, one or more data segments matching the search criteria;

receive, from a coordinator, rebalance information in response to the second node transferring a plurality of rebalance data segments to one or more nodes in the data grid, wherein the rebalance information identifies the one or more nodes storing the plurality of rebalance data segments;

identify, by the processing device, a third node storing rebalance data segments of the plurality of rebalance data segments based on the rebalance information, wherein the rebalance data segments are data segments transferred from the second node to the third node that match the search criteria and are not part of the data segments received from the second node;

communicate, to the third node, a second search request to search for the rebalance data segments matching the search criteria;

receive, from the third node, one or more rebalance data segments matching the search criteria; and

determine search result data using the data segments from the second node and the rebalance data segments from the third node.

16. The first node of claim 15, the processor further to receive, from a coordinator, data location information, wherein the data location information indicates where data is located at a plurality of nodes in the data grid.

17. The first node of claim 15, the processor further to communicate, to the application, the search results.

18. The first node of claim 15, wherein the processor to identify the third node by:

identifying, by the processor, the data segments received from the second node matching the search criteria; and

determining, by the processor, data segments not received from the second node;

determining, by the processor, that the data segments not received are stored at the third node based on the rebalance information.

19. The first node of claim 15, wherein the receive, the communicate, the identify, and the determine occur during the search query.

20. The first node of claim 15, wherein the first node, the second node, and the third node are in a data grid.