# US 2026/0310669 A1 · Optimized data structures for accelerating query execution by a data system

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

- Number: US 2026/0310669 A1
- Document ID: US20260310669A1
- Status: Published application
- Kind: A1
- Application number: 19/641,734
- Filed: 2026-04-08
- Published: 2026-10-08
- Earliest claimed: 2025-04-08
- Assignees: Dremio Corporation
- Applicants: Dremio Corporation
- Inventors: Max Lerch; Rafay Qureshi; Rahim Bhojani; Tomer Shiran
- Web page: https://patentgrep.com/patent/US20260310669A1

## CPC

- G06F 16/24542: {Plan optimisation}
- G06F 16/217: {Database tuning (G06F16/2282 takes precedence; database performance monitoring G06F11/3409)}
- G06N 20/00: Machine learning
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Varius examples of a method include: collecting, by computing hardware, query usage information; generating, by the computing hardware, based on the query usage information, a recommendation as to the generation of a potential new optimized data structure; performing, by the computing hardware, cost-benefit analysis for the potential new optimized data structure and each optimized data structure in a set of existing optimized data structures; modifying by the computing hardware, the set of existing optimized data structures based on the recommendation and the cost-benefit analysis; maintaining, by the computing hardware, the set of existing optimized data structures; using, by the computing hardware, the set of existing optimized data structures to accelerate a query by inserting at least a portion of at least one optimized data structure in the set of existing optimized data structures into a query plan for the query.

## Claims

### Claim 1

A method comprising:
collecting, by computing hardware, query usage information;
generating, by the computing hardware, based on the query usage information, a recommendation as to the generation of a potential new optimized data structure;
performing, by the computing hardware, cost-benefit analysis for the potential new optimized data structure and each optimized data structure in a set of existing optimized data structures;
modifying by the computing hardware, the set of existing optimized data structures based on the recommendation and the cost-benefit analysis;
maintaining, by the computing hardware, the set of existing optimized data structures;
using, by the computing hardware, the set of existing optimized data structures to accelerate a query by inserting at least a portion of at least one optimized data structure in the set of existing optimized data structures into a query plan for the query.

### Claim 2 (depends on 1)

The method of claim 1, wherein collecting the query usage information comprises:
monitoring, by the computing hardware, respective workload data for a set of queries;
filtering, by the computing hardware, the set of queries based on a set of criteria and the respective workload data;
analyzing, by the computing hardware, usage pattern and frequency data based on the filtering for the set of queries; and
categorizing, by the computing hardware, one or more query plan fragments from the set of queries.

### Claim 3 (depends on 2)

The method of claim 2, wherein generating, by the computing hardware, based on the query usage information, the recommendation as to the generation of a potential new optimized data structure comprises causing, by the computing hardware, at least one of a rules-based model or a machine-learning model to process the one or more plan fragments, the usage pattern and frequency data, and the respective workload data to generate the recommendation as to generation of an optimized data structure for use in accelerating the one or more future queries, wherein the recommendation as to the generation of the optimized data structure for use in accelerating the one or more future queries comprises the potential new optimized data structure.

### Claim 4 (depends on 1)

The method of claim 1, wherein performing the cost-benefit analysis for the potential new optimized data structure and each optimized data structure in the set of existing optimized data structures comprises:
determining, by the computing hardware, for the potential new optimized data structure and each respective existing optimized data structure in a set of existing optimized data structures, a respective query acceleration impact;
determining, by the computing hardware based on the respective query acceleration impact for the potential new optimized data structure and each respective existing optimized data structure in a set of existing optimized data structures, a respective query performance improvement factor;
generating, by the computing hardware based on the respective query performance improvement factor for the potential new optimized data structure and each respective existing optimized data structure in a set of existing optimized data structures, a respective comparative optimized data structure improvement score; and
normalizing, by the computing hardware, each respective comparative optimized data structure improvement score.

### Claim 5 (depends on 4)

The method of claim 4, wherein:
normalizing each respective comparative optimized data structure improvement score comprises modifying each respective comparative optimized data structure improvement score based on at least one of an age or a refresh frequency each respective existing optimized data structure in the set of existing optimized data structures.

### Claim 6 (depends on 4)

The method of claim 4, wherein determining the respective query acceleration impact comprises comparing execution of at least one query both with and without using at least a portion of the potential new optimized data structure and each respective existing optimized data structure in the set of existing optimized data structures.

### Claim 7 (depends on 4)

The method of claim 4, wherein determining the respective query performance improvement factor comprises analyzing at least one of a usage frequency, average query savings, or total query savings for each respective existing optimized data structure in the set of existing optimized data structures.

### Claim 8 (depends on 7)

The method of claim 7, wherein modifying the set of existing optimized data structures based on the recommendation and the cost-benefit analysis comprises:
applying, by the computing hardware, based on each respective normalized comparative optimized data structure improvement score, a decision-making algorithm to identify an optimal set of optimized data structures;
generating, based on the optimal set of optimized data structures, an optimized data structure generation plan; and
implementing, by the computing hardware, at least one step of the optimized data structure generation plan.

### Claim 9 (depends on 8)

The method of claim 8, wherein implementing the at least one step of the optimized data structure generation plan includes modifying the set of existing optimized data structures to include the potential new optimized data structure and exclude a particular one of the set of existing optimized data structures.

### Claim 10 (depends on 8)

The method of claim 8, wherein applying the decision-making algorithm comprises applying a set of selection criteria.

### Claim 11 (depends on 10)

The method of claim 10, wherein the set of selection criteria comprise at least one of the respective query performance improvement factor; a respective usage count for each respective existing optimized data structure in the set of existing optimized data structures; or a refresh frequency for each respective existing optimized data structure in the set of existing optimized data structures.

### Claim 12 (depends on 11)

The method of claim 11, wherein applying the decision-making algorithm comprises causing at least one of a rules-based model or a machine learning model to process the set of selection criteria and each respective normalized comparative optimized data structure improvement score to identify the optimal set of optimized data structures.

### Claim 13 (depends on 12)

The method of claim 12, wherein the optimal set of optimized data structures comprises the set of optimized data structures that provide the greatest cost-savings with respect to system resource availability.

### Claim 14 (depends on 1)

The method of claim 1, wherein inserting the at least a portion of the at least one optimized data structure in the set of existing optimized data structures into the query plan for the query comprises substituting the at least one optimized data structure in the set of existing optimized data structures into at least one plan segment of the query plan in lieu of a reference to an underlying data structure.

### Claim 15 (depends on 1)

The method of claim 1, further comprising:
identifying, by computing hardware, a modification to an Iceberg table;
determining, by the computing hardware, which of the set of existing optimized data structures that are dependent on the Iceberg table;
accessing, by the computing hardware, a set of table refresh rules;
modifying, by the computing hardware, the set of existing optimized data structures based on the modification to the Iceberg table according to the set of table refresh rules.

### Claim 16

A method comprising:
identifying, by computing hardware, a potential new optimized data structure for use in accelerating one or more future queries;
determining, by computing hardware, for the potential new optimized data structure and each respective existing optimized data structure in a set of existing optimized data structures, a respective query acceleration impact;
determined, by the computing hardware based on the respective query acceleration impact for the potential new optimized data structure and each respective existing optimized data structure in a set of existing optimized data structure, a respective query performance improvement factor;
generating, by the computing hardware based on the respective query performance improvement factor for the potential new optimized data structure and each respective existing optimized data structure in a set of existing optimized data structures, a respective comparative optimized data structure improvement score;
normalizing, by the computing hardware, each respective comparative optimized data structure improvement score;
applying, by the computing hardware, based on each respective normalized comparative optimized data structure improvement score, a decision-making algorithm to identify an optimal set of optimized data structures;
generating, based on the optimal set of optimized data structures, an optimized data structure generation plan; and
implementing, by the computing hardware, at least one step of the optimized data structure generation plan.

### Claim 17 (depends on 16)

The method of claim 16, wherein implementing at least one step of the optimized data structure generation plan includes modifying the set of existing optimized data structures to include the potential new optimized data structure and exclude a particular one of the set of existing optimized data structure.

### Claim 18 (depends on 16)

The method of claim 16, wherein applying the decision-making algorithm comprises applying a set of selection criteria.

### Claim 19 (depends on 18)

The method of claim 18, wherein the set of selection criteria comprise at least one of the respective query performance improvement factor; a respective usage count for each respective existing optimized data structure in the set of existing optimized data structures; or a refresh frequency for each respective existing optimized data structure in the set of existing optimized data structures.

### Claim 20 (depends on 16)

The method of claim 16, further comprising:
monitoring, by computing hardware, respective workload data for a set of queries;
filtering, by the computing hardware, the set of queries based on a set of criteria and the respective workload data;
analyzing, by the computing hardware, usage pattern and frequency data based on the filtering for the set of queries;
categorizing, by the computing hardware, one or more query plan fragments from the set of queries; and
causing, by the computing hardware, at least one of a rules-based model or a machine-learning model to process the one or more plan fragments, the usage pattern and frequency data, and the respective workload data to generate a recommendation as to generation of an optimized data structure for use in accelerating the one or more future queries, wherein the recommendation as to the generation of the optimized data structure for use in accelerating the one or more future queries comprises the potential new optimized data structure.
