O(n) lookup time for cached local plans
Open
performance
- Dominant language
- C
- Stars
- 12.8k
- Forks
- 794
- Avg merge
- 2d 14h
- Merged PRs (30d)
- 31
Description
When looking up if a cached local plan exists for the current query, we iterate all the cached local plans. We don't have an upper limit for the size of cached local plan list. Therefore this might impact the performance if there are many cached local plans. Using a hash table is probably better.
Contributor guide
Assessment
This issue has not been assessed yet.