Validating multiple execution plans for database queries
First Claim
Patent Images
1. A method implemented at least in part by a computing device for organizing multiple execution plans for database query, the method comprising the steps of:
- arranging a plurality of execution plans into a plurality of groups, each group having at least one operator associated with at least one operator in another of the groups;
determining identification data for each operator related to other operators in the other of the groups;
determining identification data for each execution plan based on the identification data for each operator, whereby the identification data for each execution plan uniquely identifies the respective execution plan from all other execution plans; and
storing the identification data.
1 Assignment
0 Petitions
Accused Products
Abstract
Validation of large numbers of alternative execution plans for a database query, either an exhaustive enumeration of the complete space of alternatives, or else an unbiased random sample, is performed by efficiently constructing execution trees from a data structure having groups alternative operators that are ranked in a directory. Each global rank of a plan identifies that plan uniquely among all the alternative plans. The operators are unranked from the directory according to a specification that characterizes the desired plans.
-
Citations
20 Claims
-
1. A method implemented at least in part by a computing device for organizing multiple execution plans for database query, the method comprising the steps of:
-
arranging a plurality of execution plans into a plurality of groups, each group having at least one operator associated with at least one operator in another of the groups; determining identification data for each operator related to other operators in the other of the groups; determining identification data for each execution plan based on the identification data for each operator, whereby the identification data for each execution plan uniquely identifies the respective execution plan from all other execution plans; and storing the identification data. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A method implemented at least in part by a computing device for generating a plan for executing a database query, the method comprising:
-
developing groups of operators representing alternative execution plans for a query; ranking the operators; assigning unique identifiers to the alternative execution plans based on the ranking of the operators; and storing the unique identifiers. - View Dependent Claims (13, 14, 15)
-
-
16. A computer-readable medium comprising a directory for a data structure having a plurality of groups of alternative operators for carrying out a database query in accordance with an execution plan, the directory comprising:
-
rank data for each operator in relation to the alternative operators; and unique rank data for each execution plan based on respective operator rank data, said unique rank data suitable to facilitate organization of execution plans. - View Dependent Claims (17, 18, 19, 20)
-
Specification