Query execution plans by compilation-time execution
US10983998B2 · kind B2 · utility
2Cited by
11References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jun 25, 2008 |
| Grant date | Apr 20, 2021 |
| Priority date | — |
| Expiry date | Jul 25, 2032 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/24545
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Described is a query optimizer comprising a query tuner that performs actual execution of query fragments to obtain actual results during compilation time, and uses those actual results to select a query plan. The actual results may be combined with estimates for fragments that were not executed. The tree may be traversed in a top-down traversal, processing every node. Alternatively, the tree may be traversed in a bottom-up traversal, re-deriving data for higher nodes as each lower level is completed. A limit, such as a time limit or level limit, may be used to control how much time is taken to determine the execution plan.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.