Validating multiple execution plans for database queries
US6721724B1 · kind B1 · utility
27Cited by
12References
28Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Mar 31, 2000 |
| Grant date | Apr 13, 2004 |
| Priority date | — |
| Expiry date | Mar 31, 2020 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99952
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.