| 发明名称 |
Swapping expected and candidate affinities in a query plan cache |
| 摘要 |
In an embodiment, a hit percentage of an expected affinity for a first query is calculated, wherein the expected affinity comprises a first address range in a query plan cache, a hit percentage of a candidate affinity for the first query is calculated, wherein the candidate affinity comprises a second address range in a query plan cache, and if the hit percentage of the candidate affinity is greater than the hit percentage of the expected affinity by more than a threshold amount, query plans in the candidate affinity are swapped with query plans in the expected affinity. |
| 申请公布号 |
US8812489(B2) |
申请公布日期 |
2014.08.19 |
| 申请号 |
US201213646971 |
申请日期 |
2012.10.08 |
| 申请人 |
International Business Machines Corporation |
发明人 |
Konik Rafal P.;Mittelstadt Roger A.;Muras Brian R.;Theuer Mark W. |
| 分类号 |
G06F7/00;G06F17/00 |
主分类号 |
G06F7/00 |
| 代理机构 |
|
代理人 |
Kehe Kevin D.;Nock James R. |
| 主权项 |
1. A method comprising:
calculating a hit percentage of an expected affinity for a first query, wherein the expected affinity comprises a first address range in a query plan cache; calculating a hit percentage of a candidate affinity for the first query, wherein the candidate affinity comprises a second address range in the query plan cache; comparing the hit percentage of the expected affinity for the first query and the hit percentage of the candidate affinity for the first query; and swapping, based on the hit percentage of the candidate affinity being greater than the hit percentage of the expected affinity by more than a threshold amount, query plans in the candidate affinity with query plans in the expected affinity. |
| 地址 |
Armonk NY US |
