# US 2026/0093697 A1 · Tracking Previous Search Queries and Reusing Search Results Based on a Query Execution Plan

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0093697 A1
- Document ID: US20260093697A1
- Status: Published application
- Kind: A1
- Application number: 18/901,772
- Filed: 2024-09-30
- Published: 2026-04-02
- Earliest claimed: 2024-09-30
- Assignees: Cribl, Inc.
- Applicants: Cribl, Inc.
- Inventors: Dritan Bitincka; Ledion Bitincka; Konstantinos Polychronis; Oliver Draese
- Web page: https://patentgrep.com/patent/US20260093697A1

## CPC

- G06F 16/24539: {using cached or materialised query results}
- G06F 16/24542: {Plan optimisation}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In some aspects, search functionality is provided in an observability analysis system. In some implementations, a request is received to search a dataset of an observability analysis system, the request including a search query. A hash is generated that represents the request, wherein generating the hash includes applying a hash function to a query execution plan determined from the search query and at least one parameter corresponding to the request. A determination is made whether the request satisfies a set of one or more query reuse criteria that includes a criterion that is satisfied when the hash matches a previous hash associated with a previous request to search the dataset. In accordance with determining that the set of one or more query reuse criteria is satisfied, a set of query results of the previous request to search the dataset is reused.

## Claims

### Claim 1

A method comprising:
at a system that includes one or more processors and memory:
receiving a request to search a dataset of an observability analysis system, the request including a search query;
generating a hash that represents the request, wherein generating the hash that represents the request includes applying a hash function to:
a query execution plan determined from the search query; and
at least one parameter corresponding to the request;
determining whether the request satisfies a set of one or more query reuse criteria, wherein the set of one or more query reuse criteria includes a criterion that is satisfied when the hash matches a previous hash associated with a previous request to search the dataset of the observability analysis system, wherein the previous request was received prior to the request; and
in accordance with determining that the set of one or more query reuse criteria is satisfied by the request, reusing a set of query results of the previous request to search the dataset of the observability analysis system.

### Claim 2 (depends on 1)

The method of claim 1, comprising, at the system:
receiving a second request to search the dataset of the observability analysis system, the second request including a second search query;
generating a second hash that represents the second request, wherein generating the second hash that represents the second request includes applying the hash function to:
a second query execution plan determined from the second search query; and
at least one parameter corresponding to the second request;
determining whether the second request satisfies the set of one or more query reuse criteria;
in accordance with determining that the set of one or more query reuse criteria is not satisfied by the second request, performing a new search based on the second query execution plan.

### Claim 3 (depends on 1)

The method of claim 1, comprising, at the system:
in accordance with determining that the set of one or more query reuse criteria is satisfied by the request, forgoing performing a new search based on the query execution plan determined from the search query.

### Claim 4 (depends on 1)

The method of claim 1, comprising, at the system:
after receiving the request, generating the query execution plan based on the search query.

### Claim 5 (depends on 1)

The method of claim 1, wherein the at least one parameter corresponding to the request includes a range of time to be searched.

### Claim 6 (depends on 1)

The method of claim 1, wherein the at least one parameter corresponding to the request includes a snapshot of current settings of one or more configurable settings that apply to the request.

### Claim 7 (depends on 6)

The method of claim 6, wherein the one or more configurable settings that apply to the request includes a query option.

### Claim 8 (depends on 6)

The method of claim 6, wherein the one or more configurable settings that apply to the request includes a sampling rate that applies to the request, wherein the sampling rate represents a percentage of data within the dataset that is sampled.

### Claim 9 (depends on 1)

The method of claim 1, wherein the set of one or more query reuse criteria includes a criterion that is satisfied when an age of the set of query results of the previous request satisfies a maximum acceptable age.

### Claim 10 (depends on 9)

The method of claim 9, wherein the request specifies the maximum acceptable age.

### Claim 11 (depends on 9)

The method of claim 9, wherein the maximum acceptable age is determined from a query option that applies to the request.

### Claim 12

A system comprising:
one or more processors; and
a computer-readable medium storing instructions that are operable when executed by the one or more processors to perform operations comprising:
receiving a request to search a dataset of an observability analysis system, the request including a search query;
generating a hash that represents the request, wherein generating the hash that represents the request includes applying a hash function to:
a query execution plan determined from the search query; and
at least one parameter corresponding to the request;
determining whether the request satisfies a set of one or more query reuse criteria, wherein the set of one or more query reuse criteria includes a criterion that is satisfied when the hash matches a previous hash associated with a previous request to search the dataset of the observability analysis system, wherein the previous request was received prior to the request; and
in accordance with determining that the set of one or more query reuse criteria is satisfied by the request, reusing a set of query results of the previous request to search the dataset of the observability analysis system.

### Claim 13 (depends on 12)

The system of claim 12, the operations comprising:
in accordance with determining that the set of one or more query reuse criteria is not satisfied by the request:
forgoing reusing the set of query results of the previous request to search the dataset of the observability analysis system; and
performing a new search based on the query execution plan determined from the search query.

### Claim 14 (depends on 12)

The system of claim 12, the operations comprising:
in accordance with determining that the set of one or more query reuse criteria is satisfied, forgoing performing a new search based on the query execution plan determined from the search query.

### Claim 15 (depends on 12)

The system of claim 12, wherein the at least one parameter corresponding to the request includes a range of time to be searched.

### Claim 16 (depends on 12)

The system of claim 12, wherein the at least one parameter corresponding to the request includes a snapshot of current settings of one or more configurable settings that apply to the request.

### Claim 17 (depends on 12)

The system of claim 12, wherein the set of one or more query reuse criteria includes a criterion that is satisfied when an age of the set of query results of the previous request satisfies a maximum acceptable age.

### Claim 18

A non-transitory computer-readable medium storing instructions that are operable when executed by a data-processing apparatus to perform operations comprising:
receiving a request to search a dataset of an observability analysis system, the request including a search query;
generating a hash that represents the request, wherein generating the hash that represents the request includes applying a hash function to:
a query execution plan determined from the search query; and
at least one parameter corresponding to the request;
determining whether the request satisfies a set of one or more query reuse criteria, wherein the set of one or more query reuse criteria includes a criterion that is satisfied when the hash matches a previous hash associated with a previous request to search the dataset of the observability analysis system, wherein the previous request was received prior to the request; and
in accordance with determining that the set of one or more query reuse criteria is satisfied by the request, reusing a set of query results of the previous request to search the dataset of the observability analysis system.

### Claim 19 (depends on 18)

The non-transitory computer-readable medium of claim 18, the operations comprising:
in accordance with determining that the set of one or more query reuse criteria is not satisfied by the request:
forgoing reusing the set of query results of the previous request to search the dataset of the observability analysis system; and
performing a new search based on the query execution plan determined from the search query.

### Claim 20 (depends on 18)

The non-transitory computer-readable medium of claim 18, the operations comprising:
in accordance with determining that the set of one or more query reuse criteria is satisfied, forgoing performing a new search based on the query execution plan determined from the search query.

### Claim 21 (depends on 18)

The non-transitory computer-readable medium of claim 18, wherein the at least one parameter corresponding to the request includes a range of time to be searched.

### Claim 22 (depends on 18)

The non-transitory computer-readable medium of claim 18, wherein the at least one parameter corresponding to the request includes a snapshot of current settings of one or more configurable settings that apply to the request.

### Claim 23 (depends on 18)

The non-transitory computer-readable medium of claim 18, wherein the set of one or more query reuse criteria includes a criterion that is satisfied when an age of the set of query results of the previous request satisfies a maximum acceptable age.
