Table semijoin dynamic pruning
AssigneeSap SE
InventorsManuel Mayr, Paul Willems
Life of this patent
Estimating the term…
Loading patent…
AssigneeSap SE
InventorsManuel Mayr, Paul Willems
Estimating the term…
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.
A computer-implemented method comprising:
(canceled)
(canceled)
(canceled)
A system comprising:
(canceled)
(canceled)
A non-transitory computer readable medium storing instructions, which when executed by at least one data processor, result in operations comprising:
Dependencies are inferred from the claim text.