QuakeWang opened a new pull request, #8301:
URL: https://github.com/apache/paimon/pull/8301
### Purpose
`ScoredGlobalIndexResult.topK` used 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
expected `score desc, rowId asc` ranking 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 existing `O(n log k)` algorithm.
### Tests
- `mvn -pl paimon-common
-Dtest=ScoredGlobalIndexResultTest,HybridSearchRankerTest test`
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: [email protected]
For queries about this service, please contact Infrastructure at:
[email protected]
