Granted Patent B2

US 12,353,412 · App. 18/473,752 · Granted Jul 8, 2025

Inventors: Jaehyok Chong (Seoul, KR); Young Goo Cho (Seoul, KR); Ki Hong Kim (Seoul, KR)

Assignee: SAP SE

G06F16/24542G06F16/2246G06F16/24573G06F16/284

Abstract

Claims (72)

1. A computer-implemented method comprising:

executing a first query plan for a query;

obtaining statistics for one or more internal nodes of a first query tree representing the first query plan during execution of the first query plan;

mapping keys which uniquely identify the one or more internal nodes of the first query tree to respective statistics;

receiving a second query tree representing a second query plan for the query after execution of the first query plan has completed the query;

for a selected internal node of the second query tree, searching for a matching internal node out of the one or more internal nodes of the first query tree; and

responsive to finding the matching internal node of the first query tree, applying the statistics for the matching internal node of the first query tree to the selected internal node of the second query tree for estimating cost of executing the second query plan to complete the query,

wherein the keys comprise respective signatures for operations represented by the one or more internal nodes, wherein a signature comprises an operator and one or more operands defined by a corresponding operation.

2. The computer-implemented method of claim 1 , wherein obtaining statistics for an internal node of the first query tree comprises determining a cardinality of a table resulted from an operation represented by the internal node after executing the first query plan.

3. The computer-implemented method of claim 1 , further comprising registering the keys in a dictionary.

4. The computer-implemented method of claim 3 , wherein searching for the matching internal node comprises:

generating a target key for the selected internal node of the second query tree; and

searching the dictionary for a key that matches the target key.

5. The computer-implemented method of claim 3 , wherein searching for the matching internal node comprises:

selecting an alternative subtree that is logically equivalent to a subtree of the selected internal node of the second query tree;

generating a target key for a root of the alternative subtree; and

searching the dictionary for a key that matches the target key.

6. The computer-implemented method of claim 3 , further comprising:

responsive to executing the second query plan as a result of query optimization of the query, obtaining statistics for one or more internal nodes of the second query tree;

identifying an unmatched internal node of the second query tree that has no matching internal node of the first query tree;

generating a new key uniquely identifying the unmatched internal node;

registering the new key in the dictionary; and

mapping the new key to the statistics for the unmatched internal node of the second query tree.

7. The computer-implemented method of claim 3 , further comprising:

responsive to executing the second query plan as a result of query optimization of the query, obtaining statistics for one or more internal nodes of the second query tree;

finding a matching key in the dictionary identifying the matching internal node of the first query tree corresponding to the selected internal node of the second query tree; and

mapping the matching key to the statistics for the selected internal node of the second query tree.

8. The computer-implemented method of claim 1 , wherein the keys further identify respective child nodes of the one or more internal nodes.

9. The computer-implemented method of claim 1 , wherein at least a portion of the signature is represented by a hash value.

10. The computer-implemented method of claim 1 , further comprising:

identifying a first internal node and a second internal node of the second query tree, wherein the first internal node represents a group-by operation having a known selectivity, wherein the second internal node represents a pre-aggregation of the group-by operation represented by the first internal node; and

applying the known selectivity of the first internal node to the second internal node.

11. A computing system, comprising:

memory;

one or more hardware processors coupled to the memory; and

one or more computer readable storage media storing instructions that, when loaded into the memory, cause the one or more hardware processors to perform operations comprising:

executing a first query plan for a query;

obtaining statistics for one or more internal nodes of a first query tree representing the first query plan during execution of the first query plan;

mapping keys which uniquely identify the one or more internal nodes of the first query tree to respective statistics;

receiving a second query tree representing a second query plan for the query after execution of the first query plan has completed the query;

for a selected internal node of the second query tree, searching for a matching internal node out of the one or more internal nodes of the first query tree; and

responsive to finding the matching internal node of the first query tree, applying the statistics for the matching internal node of the first query tree to the selected internal node of the second query tree for estimating cost of executing the second query plan to complete the query,

wherein the keys comprise respective signatures for operations represented by the one or more internal nodes, wherein a signature comprises an operator and one or more operands defined by a corresponding operation.

12. The computing system of claim 11 , wherein the statistics for an internal node of the first query tree comprises a cardinality of a table resulted from an operation represented by the internal node after executing the first query plan.

13. The computing system of claim 11 , wherein the operations further registering the keys in a dictionary.

14. The computing system of claim 13 , wherein searching for the matching internal node comprises:

generating a target key for the selected internal node of the second query tree; and

searching the dictionary for a key that matches the target key.

15. The computing system of claim 13 , wherein searching for the matching internal node comprises:

selecting an alternative subtree that is logically equivalent to a subtree of the selected internal node of the second query tree;

generating a target key for a root of the alternative subtree; and

searching the dictionary for a key that matches the target key.

16. The computing system of claim 13 , wherein the operations further comprise:

responsive to executing the second query plan as a result of query optimization of the query, obtaining statistics for one or more internal nodes of the second query tree;

identifying an unmatched internal node of the second query tree that has no matching internal node of the first query tree;

generating a new key uniquely identifying the unmatched internal node;

registering the new key in the dictionary; and

mapping the new key to the statistics for the unmatched internal node of the second query tree.

17. The computing system of claim 13 , wherein the operations further comprise:

responsive to executing the second query plan as a result of query optimization of the query, obtaining statistics for one or more internal nodes of the second query tree;

finding a matching key in the dictionary identifying the matching internal node of the first query tree corresponding to the selected internal node of the second query tree; and

mapping the matching key to the statistics for the selected internal node of the second query tree.

18. The computing system of claim 11 , wherein the keys further identify respective child nodes of the one or more internal nodes.

19. The computing system of claim 11 , wherein at least a portion of the signature is represented by a hash value.

20. One or more non-transitory computer-readable media having encoded thereon computer-executable instructions causing one or more processors to perform a method comprising:

executing a first query plan for a query;

obtaining cardinalities for one or more internal nodes of a first query tree representing the first query plan during execution of the first query plan;

mapping keys which uniquely identify the one or more internal nodes of the first query tree to respective statistics;

receiving a second query tree representing a second query plan for the query after execution of the first query plan has completed the query;

for a selected internal node of the second query tree, searching for a matching internal node out of the one or more internal nodes of the first query tree; and

responsive to finding the matching internal node of the first query tree, applying a cardinality for the matching internal node of the first query tree to the selected internal node of the second query tree for estimating cost of executing the second query plan to complete the query,

wherein the keys comprise respective signatures for operations represented by the one or more internal nodes, wherein a signature comprises an operator and one or more operands defined by a corresponding operation.

Assignments (1)

Continuity (2)

References Cited (25)