# US 2026/0017262 A1 · Table semijoin dynamic pruning

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

- Number: US 2026/0017262 A1
- Document ID: US20260017262A1
- Status: Published application
- Kind: A1
- Application number: 18/767,012
- Filed: 2024-07-09
- Published: 2026-01-15
- Earliest claimed: 2024-07-09
- Assignees: Sap SE
- Applicants: Sap SE
- Inventors: Manuel Mayr; Paul Willems
- Web page: https://patentgrep.com/patent/US20260017262A1

## CPC

- G06F 16/24544: {Join order optimisation}
- G06F 16/24537: {of operators}
- G06F 16/24542: {Plan optimisation}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A query execution plan is generated for a received query. The query execution plan may include a first operator with a predicate tree. The predicate tree may be expanded into one or more predicates and a value list, where the value list being empty satisfies a pruning condition. In response to determining that the pruning condition is satisfied, the first operator is pruned from the query execution plan. The value list may include a list of values specified by an expression associated with a first table and a column index of a second table. After pruning the first operator from the query execution plan, a pruned version of the query execution plan that does not include the first operator is executed.

## Claims

### Claim 1

A computer-implemented method comprising:
generating a query execution plan for a received query;
detecting a TableScan Semi Join operator with a predicate tree in the query execution plan;
expanding the predicate tree to include 1) one or more predicates and 2) a value list, both of which are combined using an AND conjunction, such that when the value list is empty, it is determined, without evaluating the one or more predicates, that the TableScan Semi Join operator does not produce a result;
responsive to determining that the value list is empty, pruning the TableScan Semi Join operator from the query execution plan; and
executing a pruned version of the query execution plan that does not include the TableScan Semi Join operator.

### Claim 2

(canceled)

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein the value list comprises a list of values specified by an expression associated with a first table and a column index of a second table.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, further comprising:
receiving a request to execute a query;
collecting a build expression associated with the receiving query;
assembling an in-list based on the build expression; and
evaluating the value list based on the in-list.

### Claim 5

(canceled)

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, wherein determining whether the value list is empty comprises evaluating an expression associated with one or more tables at run-time.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, further comprising pruning the TableScan Semi Join operator from the query execution plan without evaluating the one or more predicates of the predicate tree.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, further comprising pruning a second operator from the query execution plan when it is determined that the TableScan Semi Join operator does not produce a result.

### Claim 9

(canceled)

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, further comprising generating multiple pipelines for execution of the query.

### Claim 11 (depends on 10)

The computer-implemented method of claim 10, wherein a first pipeline is a build pipeline and wherein a second pipeline is a probe pipeline.

### Claim 12 (depends on 11)

The computer-implemented method of claim 11, further comprising expanding the predicate tree into the one or more predicates and the value list in the probe pipeline.

### Claim 13

A system comprising:
at least one processor; and
at least one memory storing instructions that, when executed by the at least one processor, cause operations comprising:
generating a query execution plan for a received query;
detecting a TableScan Semi Join operator with a predicate tree in the query execution plan;
expanding the predicate tree to include 1) one or more predicates and 2) a value list, both of which are combined using an AND conjunction, such that when the value list is empty, it is determined, without evaluating the one or more predicates, that the TableScan Semi Join operator does not produce a result;
responsive to determining that the value list is empty, pruning the TableScan Semi Join operator from the query execution plan; and
executing a pruned version of the query execution plan that does not include the TableScan Semi Join operator.

### Claim 14

(canceled)

### Claim 15 (depends on 13)

The system of claim 13, wherein the value list comprises a list of values specified by an expression associated with a first table and a column index of a second table.

### Claim 16 (depends on 13)

The system of claim 13, wherein the operations further comprise:
receiving a request to execute a query;
collecting a build expression associated with the receiving query;
assembling an in-list based on the build expression; and
evaluating the value list based on the in-list.

### Claim 17

(canceled)

### Claim 18 (depends on 13)

The system of claim 13, wherein determining whether the value list is empty comprises evaluating an expression associated with one or more tables at run-time.

### Claim 19 (depends on 13)

The system of claim 13, wherein the operations further comprise pruning the TableScan Semi Join operator from the query execution plan without evaluating the one or more predicates of the predicate tree.

### Claim 20

A non-transitory computer readable medium storing instructions, which when executed by at least one data processor, result in operations comprising:
generating a query execution plan for a received query;
detecting a TableScan Semi Join operator with a predicate tree in the query execution plan;
expanding the predicate tree to include 1) one or more predicates and 2) a value list, both of which are combined using an AND conjunction, such that when the value list is empty, it is determined, without evaluating the one or more predicates, that the TableScan Semi Join operator does not produce a result;
responsive to determining that the value list is empty, pruning the TableScan Semi Join operator from the query execution plan; and
executing a pruned version of the query execution plan that does not include the TableScan Semi Join operator.
