-
Notifications
You must be signed in to change notification settings - Fork 3.5k
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
Tokenizer tests and TokenizeLine updates #11133
Merged
+211
−34
Merged
Changes from 15 commits
Commits
Show all changes
16 commits
Select commit
Hold shift + click to select a range
2197d35
Add test functions for bloom_tokenizer.go
paul1r 2eec275
Tokenize line with a skip tokenizer properly
paul1r 8001874
Merge branch 'main' into paul1r/bloom_updates
paul1r 1b6b86c
Lint
paul1r bd97dd4
Format
paul1r 24f995f
Return each set of skip tokens as their own slice in the slice of slices
paul1r 376deda
Adjust readlib to call bloom_tokenizer and use that tokenization code…
paul1r 9bac29f
Merge branch 'main' into paul1r/bloom_updates
paul1r 2cb997f
Make format
paul1r 231c838
Stylistic updates
paul1r c03d772
PR comments
paul1r 8bdacb9
Merge branch 'main' into paul1r/bloom_updates
paul1r a98dd74
linting
paul1r f5397a5
lint
paul1r b4fb9e4
lint
paul1r 7a29691
PR comments
paul1r File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -33,6 +33,8 @@ type BloomTokenizer struct { | |
} | ||
|
||
const CacheSize = 150000 | ||
const DefaultNGramLength = 4 | ||
const DefaultNGramSkip = 0 | ||
|
||
// NewBloomTokenizer returns a new instance of the Bloom Tokenizer. | ||
// Warning: the tokens returned use the same byte slice to reduce allocations. This has two consequences: | ||
|
@@ -44,7 +46,7 @@ func NewBloomTokenizer(reg prometheus.Registerer) (*BloomTokenizer, error) { | |
metrics: newMetrics(reg), | ||
} | ||
t.cache = make(map[string]interface{}, CacheSize) | ||
t.lineTokenizer = NewNGramTokenizer(4, 5, 0) // default to 4-grams, no skip | ||
t.lineTokenizer = NewNGramTokenizer(DefaultNGramLength, DefaultNGramLength+1, DefaultNGramSkip) // default to 4-grams, no skip | ||
t.chunkIDTokenizer = ChunkIDTokenizer(t.lineTokenizer) | ||
|
||
level.Info(util_log.Logger).Log("bloom tokenizer created") | ||
|
@@ -68,6 +70,7 @@ func clearCache(cache map[string]interface{}) { | |
} | ||
} | ||
|
||
// PopulateSeriesWithBloom is intended to be called on the write path, and is used to populate the bloom filter for a given series. | ||
func (bt *BloomTokenizer) PopulateSeriesWithBloom(seriesWithBloom *SeriesWithBloom, chunks []chunk.Chunk) { | ||
clearCache(bt.cache) | ||
for idx := range chunks { | ||
|
@@ -101,7 +104,7 @@ func (bt *BloomTokenizer) PopulateSeriesWithBloom(seriesWithBloom *SeriesWithBlo | |
|
||
seriesWithBloom.Bloom.ScalableBloomFilter.TestAndAdd(tok.Key) | ||
|
||
if len(bt.cache) > 150000 { // While crude, this has proven efficient in performance testing. This speaks to the similarity in log lines near each other | ||
if len(bt.cache) >= CacheSize { // While crude, this has proven efficient in performance testing. This speaks to the similarity in log lines near each other | ||
clearCache(bt.cache) | ||
} | ||
} | ||
|
@@ -116,6 +119,30 @@ func (bt *BloomTokenizer) PopulateSeriesWithBloom(seriesWithBloom *SeriesWithBlo | |
} // for each chunk | ||
} | ||
|
||
func (bt *BloomTokenizer) TokenizeLine(line string) []Token { | ||
return bt.lineTokenizer.Tokens(line) | ||
// SearchesForTokenizerAndLine is for taking a given search string (ex: on the read/query path) and returning | ||
// all the possible tokens, given a tokenizer. | ||
// This is a multi-dimensional slice where the first slice is the offset into the line, and the | ||
// second slice is the tokens for that offset. | ||
// The offset is used if the Tokenizer has a skip value being utilized. | ||
func SearchesForTokenizerAndLine(t Tokenizer, line string) (res [][]Token) { | ||
res = make([][]Token, 0, 10) | ||
for i := range line { // iterate by runes | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. This unnecessarily iterates all runes in the line, including offsets beyond There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. ack, added a break clause |
||
if i < t.GetSkip()+1 { | ||
tmpTokens := make([]Token, 0, 100) | ||
tokens := t.Tokens(line[i:]) | ||
// As the way the tokenizer is coded, it will reuse its internal buffers, | ||
// but we need to save the data, hence the need for copying | ||
for _, token := range tokens { | ||
tmpToken := Token{} | ||
tmpToken.Key = make([]byte, len(token.Key)) | ||
copy(tmpToken.Key, token.Key) | ||
tmpTokens = append(tmpTokens, tmpToken) | ||
} | ||
if len(tokens) > 0 { | ||
res = append(res, tmpTokens) | ||
} | ||
} | ||
} | ||
|
||
return res | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
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.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This is only true if all of the skip offsets return at least one token. Otherwise, the length of the result will be less than the number of skips+1.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
yep, I've updated the doc accordingly, good catch