Caching execution plans for queries that use timestamps
US8250064B1 · kind B1 · utility
8Cited by
2References
16Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Apr 6, 2010 |
| Grant date | Aug 21, 2012 |
| Priority date | — |
| Expiry date | Feb 19, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/24553
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A computer system programmed as a database receives a query Q1. Q1 includes a predicate. The predicate includes a reference to a current timestamp of time TT1. The database has R data structures. The computer system creates a plan, Plan 1, to execute Q1. Plan 1 includes the identification of a first set of data structures, P1, to be accessed in executing Plan 1, at the current timestamp of time TT1. The number of data structures in P1 is less than R. The computer system determines that Plan 1 is valid for a period of time. The computer system stores in a cache Plan 1 and an indication that Plan 1 is valid for the period of time.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.