IP Library Granted Patent US 12,670,170
Granted Patent B1
US 12,670,170 · App. 16/778,498 · Granted Jun 30, 2026

Search recovery using a shared storage system following a failed search peer

Inventors: Alexandros Batsakis (San Francisco, CA); Mehul Goyal (Pleasanton, CA); Ashish Mathew (San Mateo, CA); Douglas Rapp (San Francisco, CA); Igor Stojanovski (San Francisco, CA); Eric Woo (San Francisco, CA)
Assignee: Cisco Technology, Inc.
G06F16/2471G06Q50/265
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,670,170
App. No.
16/778,498
Filed
Jan 31, 2020
Granted
Jun 30, 2026
Kind
B1
Art Unit
2161
USPC
707/713
Abstract

Systems and methods are described for improving data availability and/or resiliency of indexers of a data intake and query system. A data intake and query system can index and search large amounts of data using one or more indexers. An indexer can store a copy of the data it is processing, the results of processing the data, or a copy of the data that the indexer is assigned to search, in the shared storage system. In the event an indexer fails or is otherwise unable to search data that it has been assigned to search, a cluster master can assign one or more second indexers to search the data. The one or more second indexers can download the data from the shared storage system.

Claims (61)

1 . A method comprising:

receiving a bucket map identifier from a first search node for execution of at least a portion of a query by the first search node, wherein the bucket map identifier is associated with a group of data and stored in a data structure that associates the bucket map identifier with the group of data;

identifying a set of data identifiers that identify one or more groups of data with which the bucket map identifier and the first search node are associated, the one or more groups of data stored in a shared storage system accessible by a plurality of search nodes;

communicating the set of data identifiers to the first search node to execute the query;

upon communicating the set of data identifiers to the first search node to execute the query, determining that the first search node is not available by monitoring status information from each search node of the plurality of search nodes;

in response to the determining that the first search node is not available, determining that execution of the query has not been completed by the first search node in association with a portion of the one or more groups of data stored in the shared storage system and determining an uncompleted portion of the query;

generating a new query based on the uncompleted portion of the query, the new query including an indication of the portion of the one or more groups of data for which execution of the query was not completed by the first search node prior to the first search node being unavailable; and

assigning one or more second search nodes to obtain the portion of the one or more groups of data from the shared storage system and execute the new query on the portion of the one or more groups of data for which execution of the query was not completed by the first search node.

2 . The method of claim 1 , wherein the bucket map identifier is a first bucket map identifier, wherein a second bucket map identifier is associated with the one or more second search nodes and not including the first search node, and wherein assigning the one or more second search nodes is based on:

receiving the second bucket map identifier and a set of search node identifiers, wherein the set of search node identifiers identifies the one or more second search nodes, wherein a search head is configured to communicate the second bucket map identifier to the one or more second search nodes.

3 . The method of claim 1 , wherein said assigning the one or more second search nodes is based on an availability of the one or more second search nodes.

4 . The method of claim 1 , wherein execution of the query is to be performed by a first set of search nodes comprising the first search node and the one or more second search nodes.

5 . The method of claim 1 , wherein execution of the query is to be performed by a first set of search nodes that does not include at least one of the one or more second search nodes.

6 . The method of claim 1 , wherein determining that the first search node is not available is based on one or more metrics associated with the first search node satisfying a metrics threshold.

7 . The method of claim 1 , wherein determining that the first search node is not available is based on an amount of available processing resources of the first search node satisfying a processing resources threshold.

8 . The method of claim 1 , wherein the portion of the one or more groups of data comprises the one or more groups of data.

9 . The method of claim 1 , wherein assignment to the one or more second search nodes is based on utilization rates.

10 . The method of claim 1 , further comprising disassociating the first search node from the one or more groups of data.

11 . The method of claim 1 , wherein the determination that execution of the query has not been completed is based on obtaining partial search results from the first search node.

12 . The method of claim 1 , further comprising:

identifying a plurality of bucket map identifiers that are associated with the first search node, wherein each of the plurality of bucket map identifiers associate the first search node with one or more data identifiers; and

for each of the plurality of bucket map identifiers, disassociating the one or more data identifiers from the first search node.

13 . The method of claim 1 , further comprising:

identifying a plurality of bucket map identifiers that are associated with the first search node, wherein each of the plurality of bucket map identifiers associate the first search node with one or more data identifiers; and

for each of the plurality of bucket map identifiers:

associating the one or more data identifiers with the one or more second search nodes, and

disassociating the one or more data identifiers from the first search node.

14 . The method of claim 1 , wherein said assigning the one or more second search nodes comprises:

assigning a second search node of the one or more second search nodes to execute a first portion of the new query on the portion of the one or more groups of data; and

assigning a third search node of the one or more second search nodes to execute a second portion of the new query on the portion of the one or more groups of data.

15 . The method of claim 1 , wherein said assigning the one or more second search nodes comprises associating the one or more second search nodes with the bucket map identifier.

16 . The method of claim 1 , wherein said assigning the one or more second search nodes comprises disassociating the first search node from the bucket map identifier.

17 . The method of claim 1 , wherein the one or more groups of data comprise only one group of data.

18 . The method of claim 1 , wherein the bucket map identifier is associated with filter criteria, the filter criteria associated with the query, wherein the query identifies a set of data and manner of processing the set of data, and wherein the one or more groups of data correspond to a subset of the set of data identified by the query.

19 . The method of claim 1 , wherein the bucket map identifier indicates data associated with the set of data identifiers for execution of the query by a first set of search nodes, including the first search node, at a first time period and indicates data associated with a second set of data identifiers for execution of the query by the first set of search nodes at a second time period.

20 . The method of claim 1 , wherein the bucket map identifier is associated with each data identifier of the set of data identifiers.

21 . The method of claim 1 , wherein the one or more groups of data comprise one or more slices of data, wherein the one or more slices of data comprise at least one of raw machine data, structured data, unstructured data, performance metrics data, correlation data, data files, directories of files, data sent over a network, event logs, registries, JSON blobs, XML data, data in a data model, report data, tabular data, messages published to streaming data sources, data exposed in an API, data in a relational database, sensor data, image data, or video data.

22 . The method of claim 1 , wherein the one or more groups of data comprise a bucket, wherein the bucket comprises an inverted index and a plurality of events corresponding to one or more slices of data, the inverted index corresponding to the plurality of events, wherein the one or more slices of data comprise at least one of raw machine data, structured data, unstructured data, performance metrics data, correlation data, data files, directories of files, data sent over a network, event logs, registries, JSON blobs, XML data, data in a data model, report data, tabular data, messages published to streaming data sources, data exposed in an API, data in a relational database, sensor data, image data, or video data.

23 . The method of claim 1 , wherein the one or more groups of data comprise a plurality of buckets, wherein each bucket of the plurality of buckets comprises a particular inverted index and a particular plurality of events corresponding to a particular one or more slices of data, the particular inverted index corresponding to the particular plurality of events, wherein each particular one or more slices of data comprise at least one of raw machine data, structured data, unstructured data, performance metrics data, correlation data, data files, directories of files, data sent over a network, event logs, registries, JSON blobs, XML data, data in a data model, report data, tabular data, messages published to streaming data sources, data exposed in an API, data in a relational database, sensor data, image data, or video data.

24 . The method of claim 1 , wherein the one or more groups of data comprise a plurality of buckets, wherein each data identifier of the set of data identifiers identifies a corresponding bucket of the plurality of buckets.

25 . The method of claim 1 , wherein said determining that the first search node is not available is based on an absence of communications from the first search node.

26 . The method of claim 1 , wherein said determining that the first search node is not available comprises determining at least one of a network failure, an error associated with the first search node, a utilization rate of the first search node, an amount of processing resources used or in use by the first search node, or an amount of memory used or in use by the first search node.

27 . The method of claim 1 , wherein said determining that the first search node is not available is based on at least one of a determination that the first search node did not execute the query on the portion of the one or more groups of data, a determination that the first search node is busy, or a determination that the first search node is failing.

28 . A computing system corresponding to a search head of a data intake and query system, the computing system comprising:

memory; and

one or more processors coupled to the memory and configured to:

receive a bucket map identifier from a first search node for execution of at least a portion of a query by the first search node, wherein the bucket map identifier is associated with a group of data and stored in a data structure that associates the bucket map identifier with the group of data;

identify a set of data identifiers that identify one or more groups of data with which the bucket map identifier and the first search node are associated, the one or more groups of data stored in a shared storage system accessible by a plurality of search nodes;

communicate the set of data identifiers to the first search node to execute the query;

upon communicating the set of data identifiers to the first search node to execute the query, determine that the first search node is not available by monitoring status information from each search node of the plurality of search nodes;

in response to the determining that the first search node is not available, determine that execution of the query has not been completed by the first search node in association with a portion of the one or more groups of data stored in the shared storage system and determining an uncompleted portion of the query;

generate a new query based on the uncompleted portion of the query, the new query including an indication of the portion of the one or more groups of data for which execution of the query was not completed by the first search node prior to the first search node being unavailable; and

assign one or more second search nodes to obtain the portion of the one or more groups of data from the shared storage system and execute the new query on the portion of the one or more groups of data for which execution of the query was not completed by the first search node.

29 . Non-transitory computer readable media comprising computer-executable instructions that, when executed by a computing system corresponding to a search head of a data intake and query system, cause the computing system to:

receive a bucket map identifier from a first search node for execution of at least a portion of a query by the first search node, wherein the bucket map identifier is associated with a group of data and stored in a data structure that associates the bucket map identifier with the group of data;

identify a set of data identifiers that identify one or more groups of data with which the bucket map identifier and the first search node are associated, the one or more groups of data stored in a shared storage system accessible by a plurality of search nodes;

communicate the set of data identifiers to the first search node to execute the query;

upon communicating the set of data identifiers to the first search node to execute the query, determine that the first search node is not available by monitoring status information from each search node of the plurality of search nodes;

in response to the determining that the first search node is not available, determine that execution of the query has not been completed by the first search node in association with a portion of the one or more groups of data stored in the shared storage system and determining an uncompleted portion of the query;

generate a new query based on the uncompleted portion of the query, the new query including an indication of the portion of the one or more groups of data for which execution of the query was not completed by the first search node prior to the first search node being unavailable; and

assign one or more second search nodes to obtain the portion of the one or more groups of data from the shared storage system and execute the new query on the portion of the one or more groups of data for which execution of the query was not completed by the first search node.

Assignments (3)
CHANGE OF NAME Recorded Jul 22, 2025
From: SPLUNK INC.
To: SPLUNK LLC
Reel/Frame 072170/0599 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 22, 2025
From: SPLUNK LLC
To: CISCO TECHNOLOGY, INC.
Reel/Frame 072173/0058 →
CHANGE OF NAME Recorded Jan 6, 2025
From: SPLUNK INC.
To: SPLUNK LLC
Reel/Frame 069826/0065 →
References Cited (190)
US 5566171A · Levinson · 1996 [cited by applicant]
US 5914874A · Nohara · 1999 [cited by applicant]
US 7401132B1 · Krumel et al. · 2008 [cited by applicant]
US 7917495B1 · Chapman et al. · 2011 [cited by applicant]
US 7937344B2 · Baum et al. · 2011 [cited by applicant]
US 8112425B2 · Baum et al. · 2012 [cited by applicant]
US 8312037B1 · Bacthavachalu et al. · 2012 [cited by applicant]
US 8504521B2 · Okamoto · 2013 [cited by applicant]
US 8751529B2 · Zhang et al. · 2014 [cited by applicant]
US 8776086B1 · Chhabra et al. · 2014 [cited by applicant]
US 8788525B2 · Neels et al. · 2014 [cited by applicant]
US 9063939B2 · Dalton · 2015 [cited by applicant]
US 9092502B1 · Cannaliato et al. · 2015 [cited by applicant]
US 9215240B2 · Merza et al. · 2015 [cited by applicant]
US 9286413B1 · Coates et al. · 2016 [cited by applicant]
US 9356995B1 · Schaeffer, III · 2016 [cited by applicant]
US 9451025B2 · Kazi et al. · 2016 [cited by applicant]
US 9785480B2 · Kamawat et al. · 2017 [cited by applicant]
US 9917888B1 · Bonagiri et al. · 2018 [cited by applicant]
US 10127258B2 · Lamas et al. · 2018 [cited by applicant]
US 10129118B1 · Ghare et al. · 2018 [cited by applicant]
US 10162875B2 · Hattori · 2018 [cited by applicant]
US 10194001B1 · Gardiner et al. · 2019 [cited by applicant]
US 10325032B2 · Dageville et al. · 2019 [cited by applicant]
US 10474544B1 · Li et al. · 2019 [cited by applicant]
US 10474656B1 · Bronnikov · 2019 [cited by applicant]
US 10585755B2 · Yamamoto · 2020 [cited by applicant]
US 10616314B1 · Plenderleith et al. · 2020 [cited by applicant]
US 10620883B1 · Cai et al. · 2020 [cited by applicant]
US 10657061B1 · Marriner · 2020 [cited by applicant]
US 10684888B1 · Sethuramalingam et al. · 2020 [cited by applicant]
US 10685041B2 · Hattori · 2020 [cited by applicant]
US 10740009B2 · Chen et al. · 2020 [cited by applicant]
US 10795735B1 · Potnis et al. · 2020 [cited by applicant]
US 10924548B1 · Karumbunathan et al. · 2021 [cited by applicant]
US 10936589B1 · Beitchman et al. · 2021 [cited by applicant]
US 10963189B1 · Neelakantam et al. · 2021 [cited by applicant]
US 10990480B1 · Bernat et al. · 2021 [cited by applicant]
US 11003714B1 · Batsakis et al. · 2021 [cited by applicant]
US 11089105B1 · Karumbunathan et al. · 2021 [cited by applicant]
US 11119989B1 · Dance · 2021 [cited by applicant]
US 11120800B1 · Cheng et al. · 2021 [cited by applicant]
US 11157497B1 · Batsakis et al. · 2021 [cited by applicant]
US 11275733B1 · Batsakis et al. · 2022 [cited by applicant]
US 11294916B2 · Kondiles et al. · 2022 [cited by applicant]
US 11327992B1 · Batsakis et al. · 2022 [cited by applicant]
US 11334543B1 · Anwar et al. · 2022 [cited by applicant]
US 11416465B1 · Anwar et al. · 2022 [cited by applicant]
US 11436116B1 · Batsakis et al. · 2022 [cited by applicant]
US 11449371B1 · Goyal et al. · 2022 [cited by applicant]
US 11609913B1 · Anwar et al. · 2023 [cited by applicant]
US 11615082B1 · Shrigondekar et al. · 2023 [cited by applicant]
US 11620288B2 · Batsakis et al. · 2023 [cited by applicant]
US 11809395B1 · Fan et al. · 2023 [cited by applicant]
US 11892996B1 · Anwar et al. · 2024 [cited by applicant]
US 11966797B2 · Goyal et al. · 2024 [cited by applicant]
US 12019634B1 · Anwar et al. · 2024 [cited by applicant]
US 20040153528A1 · Suzuki · 2004 [cited by applicant]
US 20060015773A1 · Singh et al. · 2006 [cited by applicant]
US 20060114903A1 · Duffy et al. · 2006 [cited by applicant]
US 20070037563A1 · Yang et al. · 2007 [cited by applicant]
US 20080013566A1 · Smith et al. · 2008 [cited by applicant]
US 20080215546A1 · Baum et al. · 2008 [cited by applicant]
US 20080294661A1 · Garza et al. · 2008 [cited by applicant]
US 20100005055A1 · An et al. · 2010 [cited by applicant]
US 20100063950A1 · Joshi et al. · 2010 [cited by applicant]
US 20100106767A1 · Livshits et al. · 2010 [cited by applicant]
US 20100107158A1 · Chen et al. · 2010 [cited by applicant]
US 20100122184A1 · Vonog et al. · 2010 [cited by applicant]
US 20100293555A1 · Vepsalainen · 2010 [cited by applicant]
US 20100318650A1 · Nielsen · 2010 [cited by applicant]
US 20110041136A1 · Messier et al. · 2011 [cited by applicant]
US 20110199899A1 · Lemaire et al. · 2011 [cited by applicant]
US 20110298596A1 · Warrick · 2011 [cited by applicant]
US 20120078975A1 · Chen et al. · 2012 [cited by applicant]
US 20120317579A1 · Liu · 2012 [cited by applicant]
US 20130091251A1 · Walker et al. · 2013 [cited by applicant]
US 20130151535A1 · Dusberger et al. · 2013 [cited by applicant]
US 20130311735A1 · Sivakumar et al. · 2013 [cited by applicant]
US 20140071290A1 · Collen et al. · 2014 [cited by applicant]
US 20140108633A1 · Dai et al. · 2014 [cited by applicant]
US 20140136255A1 · Grabovski et al. · 2014 [cited by applicant]
US 20140149783A1 · Georgiev · 2014 [cited by examiner]
US 20140189062A1 · Yan et al. · 2014 [cited by applicant]
US 20140236889A1 · Vasan et al. · 2014 [cited by applicant]
US 20140236890A1 · Vasan · 2014 [cited by examiner]
US 20140366020A1 · Lee et al. · 2014 [cited by applicant]
US 20140372616A1 · Arisoylu et al. · 2014 [cited by applicant]
US 20150067097A1 · Hsia et al. · 2015 [cited by applicant]
US 20150095457A1 · Goda et al. · 2015 [cited by applicant]
US 20150120928A1 · Gummaraju et al. · 2015 [cited by applicant]
US 20150347508A1 · Lang · 2015 [cited by examiner]
US 20160036903A1 · Pal et al. · 2016 [cited by applicant]
US 20160055225A1 · Xu et al. · 2016 [cited by applicant]
US 20160087855A1 · Vlachogiannis et al. · 2016 [cited by applicant]
US 20160117318A1 · Helland · 2016 [cited by applicant]
US 20160210071A1 · Kawahara · 2016 [cited by applicant]
US 20160224570A1 · Sharp et al. · 2016 [cited by applicant]
US 20160224660A1 · Munk et al. · 2016 [cited by applicant]
US 20160226731A1 · Maroulis · 2016 [cited by applicant]
US 20160261716A1 · Khalaf et al. · 2016 [cited by applicant]
US 20160314163A1 · Marquardt et al. · 2016 [cited by applicant]
US 20160314211A1 · Kerai et al. · 2016 [cited by applicant]
US 20160321352A1 · Patel et al. · 2016 [cited by applicant]
US 20160323193A1 · Zhou et al. · 2016 [cited by applicant]
US 20170055916A1 · Bhattacharya et al. · 2017 [cited by applicant]
US 20170123856A1 · Baptist et al. · 2017 [cited by applicant]
US 20170139996A1 · Marquardt et al. · 2017 [cited by applicant]
US 20170163724A1 · Puri et al. · 2017 [cited by applicant]
US 20170220651A1 · Mathew et al. · 2017 [cited by applicant]
US 20170262551A1 · Cho et al. · 2017 [cited by applicant]
US 20170286038A1 · Li et al. · 2017 [cited by applicant]
US 20170329390A1 · Shah et al. · 2017 [cited by applicant]
US 20170346887A1 · Kaguma et al. · 2017 [cited by applicant]
US 20170371568A1 · Aravot et al. · 2017 [cited by applicant]
US 20180032478A1 · Felderman et al. · 2018 [cited by applicant]
US 20180075103A1 · Kogan · 2018 [cited by examiner]
US 20180089278A1 · Bhattacharjee et al. · 2018 [cited by applicant]
US 20180089328A1 · Bath et al. · 2018 [cited by applicant]
US 20180241802A1 · Bernat et al. · 2018 [cited by applicant]
US 20180255121A1 · Hiltunen et al. · 2018 [cited by applicant]
US 20180285418A1 · Petropoulos et al. · 2018 [cited by applicant]
US 20180314746A1 · Gujarathi · 2018 [cited by applicant]
US 20180322157A1 · Lee et al. · 2018 [cited by applicant]
US 20190005067A1 · Bao et al. · 2019 [cited by applicant]
US 20190098106A1 · Mungel et al. · 2019 [cited by applicant]
US 20190155714A1 · Zhang et al. · 2019 [cited by applicant]
US 20190155806A1 · Mathew et al. · 2019 [cited by applicant]
US 20190171748A1 · Duffield · 2019 [cited by applicant]
US 20190188315A1 · Hsieh et al. · 2019 [cited by applicant]
US 20190221313A1 · Rim et al. · 2019 [cited by applicant]
US 20190236197A1 · Karlapudi et al. · 2019 [cited by applicant]
US 20190272271A1 · Bhattacharjee et al. · 2019 [cited by applicant]
US 20190310977A1 · Pal et al. · 2019 [cited by applicant]
US 20200044927A1 · Apostolopoulos et al. · 2020 [cited by applicant]
US 20200050372A1 · Venkatesh et al. · 2020 [cited by applicant]
US 20200050607A1 · Pal et al. · 2020 [cited by applicant]
US 20200068010A1 · Xing et al. · 2020 [cited by applicant]
US 20200073876A1 · Lopez et al. · 2020 [cited by applicant]
US 20200082015A1 · Watts et al. · 2020 [cited by applicant]
US 20200104864A1 · Mohanlal et al. · 2020 [cited by applicant]
US 20200128094A1 · De Laverene et al. · 2020 [cited by applicant]
US 20200177333A1 · Liu · 2020 [cited by applicant]
US 20200195501A1 · Shenoy et al. · 2020 [cited by applicant]
US 20200265087A1 · Verma · 2020 [cited by applicant]
US 20200310884A1 · Villalobos et al. · 2020 [cited by applicant]
US 20200327953A1 · Fleming et al. · 2020 [cited by applicant]
US 20200364223A1 · Pal et al. · 2020 [cited by applicant]
US 20200394225A1 · Nair et al. · 2020 [cited by applicant]
US 20200403822A1 · Pompelio · 2020 [cited by applicant]
US 20210034571A1 · Bedadala et al. · 2021 [cited by applicant]
US 20210173748A1 · Mukku · 2021 [cited by applicant]
US 20220382755A1 · Batsakis · 2022 [cited by applicant]
US 20230014346A1 · Goyal · 2023 [cited by applicant]
US 20240111606A1 · Chanler et al. · 2024 [cited by applicant]
US 20240118905A1 · Kondiles et al. · 2024 [cited by applicant]
US 20240202006A1 · Krijger et al. · 2024 [cited by applicant]
Batsakis et al., U.S. Appl. No. 16/778,511, filed Jan. 31, 2020. [cited by applicant]
Batsakis et al., U.S. Appl. No. 16/778,427, filed Jan. 31, 2020. [cited by applicant]
Google Scholar/Patents—text refined (Year: 2021). [cited by applicant]
U.S. Appl. No. 16/778,427, filed Jan. 31, 2020, Batsakis et al. [cited by applicant]
U.S. Appl. No. 16/778,511, filed Jan. 31, 2020, Batsakis et al. [cited by applicant]
Bitincka, Ledion et al., “Optimizing Data Analysis with a Semi-structured Time Series Database,” self-published, first presented at “Workshop on Managing Systems via Log Analysis and Machine Learning Techniques (SLAML)”… [cited by applicant]
Carraso, David, “Exploring Splunk,” published by CITO Research, New York, NY, Apr. 2012. [cited by applicant]
SLAML 10 Reports, Workshop On Managing Systems via Log Analysis and Machine Learning Techniques, ;login: Feb. 2011 Conference Reports. [cited by applicant]
Splunk Enterprise 8.0.0 Overview, available online, retrieved May 20, 2020 from docs.splunk.com. [cited by applicant]
Splunk Cloud 8.0.2004 User Manual, available online, retrieved May 20, 2020 from docs.splunk.com. [cited by applicant]
Splunk Quick Reference Guide, updated 2019, available online at https://www.splunk.com/pdfs/solution-guides/splunk-quick-reference-guide.pdf, retrieved May 20, 2020. [cited by applicant]
Alfred, “What we do,” URL: https://helloalfred.com/what-we-do/, in 4 pages, captured Aug. 27, 2019. [cited by applicant]
U.S. Appl. No. 16/513,365, filed Jul. 16, 2019. [cited by applicant]
U.S. Appl. No. 16/778,427, filed Jan. 31, 2020. [cited by applicant]
U.S. Appl. No. 17/162,477, filed Jan. 29, 2021. [cited by applicant]
U.S. Appl. No. 17/162,491, filed Jan. 29, 2021. [cited by applicant]
U.S. Appl. No. 17/162,536, filed Jan. 29, 2021. [cited by applicant]
U.S. App. No. 17/444,173, filed Jul. 30, 2021. [cited by applicant]
U.S. Appl. No. 17/652,620, filed Feb. 25, 2022. [cited by applicant]
U.S. Appl. No. 16/945,578, filed Jul. 31, 2020, Sajja et al. [cited by applicant]
U.S. Appl. No. 16/945,631, filed Jul. 31, 2020, Shrigondekar et al. [cited by applicant]
U.S. Appl. No. 16/945,646, filed Jul. 31, 2020, Shrigondekar et al. [cited by applicant]
U.S. Appl. No. 17/901,58, filed Sep. 1, 2022, Batsakis et al. [cited by applicant]
U.S. Appl. No. 17/933,455, filed Sep. 19, 2022, Goyal et al. [cited by applicant]
Balazinska, et al., Fault-tolerance and high availability in data stream management systems; https://homes.cs.washington.edu/-magda/encyclopedia-short.pdf; Publication Date Provided by WayBack Machine for attached copy:… [cited by applicant]
U.S. Appl. No. 18/123,758, filed Mar. 20, 2023, Anwar et al. [cited by applicant]
U.S. Appl. No. 18/295,123, filed Apr. 3, 2023, Batsakis et al. [cited by applicant]
U.S. Appl. No. 18/329,874, filed Jun. 6, 2023, Anwar et al. [cited by applicant]
U.S. Appl. No. 18/542,468, filed Dec. 15, 2023, Anwar et al. [cited by applicant]
U.S. Appl. No. 18/162,480, filed Jan. 31, 2023, Xie et al. [cited by applicant]
U.S. Appl. No. 18/162,273, filed Jan. 31, 2023, Xie et al. [cited by applicant]
U.S. Appl. No. 18/735,936, filed Jun. 6, 2024, Anwar et al. [cited by applicant]
U.S. Appl. No. 18/641,089, filed Apr. 19, 2024, Goyal et al. [cited by applicant]