Relational database scalar subquery optimization
US7873627B2 · kind B2 · utility
8Cited by
12References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jan 18, 2006 |
| Grant date | Jan 18, 2011 |
| Priority date | — |
| Expiry date | Apr 28, 2028 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/24542
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
When two or more scalar subtrees in an execution plan are directed towards the same data set, but request different data from the data set, the two subtrees are replaced in the execution plan with a new subtree which queries the data set only once. This new query to the data set covers all data required by the different subtrees. A pivoting step then is used to separate the data which would have been sought by each subtree. The pivoting step also yields data in the same form as would have resulted from the original subtrees.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.