The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jun. 11, 2019
Filed:
Jan. 12, 2018
Applicant:
Red Hat, Inc., Raliegh, NC (US);
Inventors:
Mircea Markus, London, GB;
William Rosenquist Burns, Annapolis, MD (US);
Assignee:
Red Hat, Inc., Raleigh, NC (US);
Primary Examiner:
Int. Cl.
CPC ...
G06F 16/00 (2019.01); G06F 11/16 (2006.01); G06F 16/28 (2019.01); G06F 16/22 (2019.01); G06F 16/23 (2019.01); G06F 16/2455 (2019.01); G06F 16/9535 (2019.01); G06F 16/2457 (2019.01); G06Q 20/10 (2012.01); G06F 11/00 (2006.01); G06F 11/07 (2006.01); G06Q 20/40 (2012.01); G06Q 40/02 (2012.01);
U.S. Cl.
CPC ...
G06F 11/1662 (2013.01); G06F 11/00 (2013.01); G06F 11/0709 (2013.01); G06F 11/0757 (2013.01); G06F 11/1658 (2013.01); G06F 16/2255 (2019.01); G06F 16/2282 (2019.01); G06F 16/2291 (2019.01); G06F 16/2358 (2019.01); G06F 16/2379 (2019.01); G06F 16/2455 (2019.01); G06F 16/24575 (2019.01); G06F 16/285 (2019.01); G06F 16/9535 (2019.01); G06Q 20/102 (2013.01); G06F 2201/805 (2013.01); G06F 2201/82 (2013.01); G06Q 20/4016 (2013.01); G06Q 40/02 (2013.01);
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.