Query plan management in shared distributed data stores
US9002824B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jun 21, 2012 |
| Grant date | Apr 7, 2015 |
| Priority date | — |
| Expiry date | Jun 6, 2033 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/9027
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The invention identifies and caches query plans in a shared-nothing distributed data store that are unlikely to become invalid because they do not reference objects that are likely to be changed or deleted. Plans that are likely to become invalid and are not cached are those plans that reference data that is partitioned across segment/query execution nodes of the data store, plans that are complex, and plans that reference objects that are not “built-in” (primitive) objects. The effect is that most plans which are generated on a query dispatch (master) node are not cached, whereas most plans generated on an execution (segment) node are cached.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.