Makes lineal the calculation of IndicesQueryCache #97600
Closed
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
As per #97222, the calculation of
IndicesQueryCacheis computationally expensive due to some internal loops. Reading the current code, it'd be hard to simplify the calculation, without a big refactor. This is asad and hackyattempt to give a solution to the current situation (Draft PR 😉), so users won't be affected by thisO(n^2)loop.In strange case that this solution suffices in the short term, we can apply the same idea to the following classes, which are still using the old approach TransportClusterStatsAction.java & TransportClusterStatsAction.javaLast night, in a dream, I came up with hismemoizedsolution, which I applied to these 2 classes.closes #97222