feat(query): optimize sort merging with adaptive loser trees - #20218
Draft
forsaken628 wants to merge 2 commits into
Draft
feat(query): optimize sort merging with adaptive loser trees#20218forsaken628 wants to merge 2 commits into
forsaken628 wants to merge 2 commits into
Conversation
github-actions
Bot
added
the
pr-feature
Contributor
Docker Image for PR
|
Contributor
forsaken628
added
ci-benchmark-local
Contributor
Docker Image for PR
|
Contributor
ClickBench Report |
forsaken628
added
ci-benchmark-cloud
Contributor
Docker Image for PR
|
Contributor
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.
I hereby agree to the terms of the CLA available at: https://docs.databend.com/dev/policies/cla/
Summary
Cursorand owned by merger-side row storage, avoiding repeated row lookup in comparison paths.SortAlgorithminterface.Rowstype through core sort, collect, and spill processors, while keeping runtime dispatch outside monomorphized hot loops.Cursorin the Top-N path and extend sync, async, limit, move-safety, and fuzz coverage.Tests
Type of change
This change is