[core] Stabilize scored global index top-k tie-breaking#8301
Merged
Conversation
Signed-off-by: QuakeWang <wangfuzheng0814@foxmail.com>
Contributor
|
+1 |
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
2 participants
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
ScoredGlobalIndexResult.topKused a min-heap ordered only by score, and replaced the heap head only when a new row had a strictly higher score. When rows tied around the top-k boundary, the retained row IDs could differ from the expectedscore desc, rowId ascranking semantics.This patch makes the heap head represent the weakest retained candidate by
score asc, rowId desc, so tied boundary rows prefer smaller row IDs while keeping the existingO(n log k)algorithm.Tests
mvn -pl paimon-common -Dtest=ScoredGlobalIndexResultTest,HybridSearchRankerTest test