perf: optimize block-stm secondary store memory allocation #25767
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.
Description
use bitmap + sync.Map to replace btree in secondary store to optimize memory allocation.
The benchmark shows significant allocation drop in random and worst case, and also better cpu performance. A little bit regression in no-conflict case, probably because of the increased baseline overhead of the bitmap, but in general it looks like a good deal.
NOTE: we can potentially optimize the top level btree with
sync.Mapas well, but that'll add complexity and overheads to iteration support, if we decides to treat iteration as second class citizen, we can do that.