Substantially improve performance of search request filtering #1413
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.
Long story short, I discovered the CPU utilization rose substantially for each entry in the list of incoming search request filters, as did garbage collection pressure. I finally tracked it down to inefficiencies of
IEnumerablehandling; to iterate over one (such asAny()in this example) a whole state machine is created, and this can't be optimized out because of the dynamic nature.I switched the type of collection for the compiled filter regular expressions from
IEnumerabletoRegex[]and the computation time for filtering dropped from ~45ms for a list of 30 filters to under 1ms (not sure how many ns but negligible).Here we see, from left to right:
I'm positive that I've identified the culprit and have verified locally the benefits to this change. I'm expecting performance with just about any number of filters to be the same as with zero filters once this change is deployed.