Add seek_gte B-tree operation for efficient single-key seek#12
Open
mynameborat wants to merge 1 commit into
Open
Add seek_gte B-tree operation for efficient single-key seek#12mynameborat wants to merge 1 commit into
mynameborat wants to merge 1 commit into
Conversation
New B-tree primitive that finds the first entry >= a given key using a single binary search (find) per node. More efficient than get_any() which uses match_range (two binary searches) and wraps results in a QueryResultHandle. Implementation includes cross-leaf fallback: when the target entry is at a leaf boundary, the walk function captures the next child's ID before releasing the parent lock, then descends to the next subtree's leftmost entry. Tree-shared lock prevents structural changes during the operation. Added across full stack: - Btree: seek_gte_internal, seek_gte_walk, seek_gte_in_leaf, leftmost_entry - BtreeIndex trait: seek_gte method - UnshardedBtree: pass-through to underlying Btree - ShardedBtree: partition-routed pass-through - TableIndex: seek_gte with key validation and DbKey wrapping - Table: convenience method delegating to primary index
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.
New B-tree primitive that finds the first entry >= a given key using a single binary search (find) per node. More efficient than get_any() which uses match_range (two binary searches) and wraps results in a QueryResultHandle.
Implementation includes cross-leaf fallback: when the target entry is at a leaf boundary, the walk function captures the next child's ID before releasing the parent lock, then descends to the next subtree's leftmost entry. Tree-shared lock prevents structural changes during the operation.
Added across full stack: