Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[ML] address two edge cases for categorization.GrokPatternCreator#findBestGrokMatchFromExamples #51168

Conversation

benwtrent
Copy link
Member

There are two edge cases that can be ran into when example input is matched in a weird way.

  1. Recursion depth could continue many many times, resulting in a HUGE runtime cost. I put a limit of 10 recursions (could be adjusted I suppose).
  2. If there are no "fixed regex bits", exploring the grok space would result in a fence-post error during runtime (with assertions turned off)

@elasticmachine
Copy link
Collaborator

Pinging @elastic/ml-core (:ml)

@benwtrent benwtrent requested a review from droberts195 January 17, 2020 16:25
Copy link
Contributor

@droberts195 droberts195 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM

@benwtrent
Copy link
Member Author

run elasticsearch-ci/bwc

@benwtrent
Copy link
Member Author

@elasticmachine update branch

@benwtrent
Copy link
Member Author

@elasticmachine update branch

@benwtrent benwtrent merged commit 79eb5aa into elastic:master Jan 21, 2020
@benwtrent benwtrent deleted the feature/ml-fix-category-grok-pattern-creator-bugs branch January 21, 2020 14:32
benwtrent added a commit to benwtrent/elasticsearch that referenced this pull request Jan 21, 2020
…dBestGrokMatchFromExamples (elastic#51168)

There are two edge cases that can be ran into when example input is matched in a weird way.

1. Recursion depth could continue many many times, resulting in a HUGE runtime cost. I put a limit of 10 recursions (could be adjusted I suppose). 
2. If there are no "fixed regex bits", exploring the grok space would result in a fence-post error during runtime (with assertions turned off)
benwtrent added a commit that referenced this pull request Jan 21, 2020
…dBestGrokMatchFromExamples (#51168) (#51255)

There are two edge cases that can be ran into when example input is matched in a weird way.

1. Recursion depth could continue many many times, resulting in a HUGE runtime cost. I put a limit of 10 recursions (could be adjusted I suppose). 
2. If there are no "fixed regex bits", exploring the grok space would result in a fence-post error during runtime (with assertions turned off)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants