Conversation
jerry-024
marked this pull request as draft
September 16, 2026 09:01
jerry-024
changed the title
jerry-024
force-pushed
the
optimize-row-range-from-bitmap
branch
from
September 20, 2026 07:41
6939b71 to
501f75a
Compare
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Purpose
Reduce scan-planning overhead and memory allocations when building row-range indexes from bitmap results, especially when an index query returns many fragmented ranges.
Implementation
Add
RowRangeIndex.fromBitmapto build the index directly from ordered bitmap ranges, while retaining the existing sort-and-merge path for mixed-sign values.Tests
Add an equivalence test comparing the new and existing construction paths across empty, singleton, sparse, contiguous, boundary, and mixed-sign bitmaps.