QuakeWang opened a new pull request, #8348:
URL: https://github.com/apache/paimon/pull/8348

   ### Purpose
   
   Java hybrid ranker currently sorts all fused candidates before truncating to 
topK, making the final selection O(n log n). This PR replaces that full sort 
with a bounded heap, reducing it to O(n log limit) while preserving the 
existing score desc / rowId asc tie-breaking semantics.
   
   A regression test is added to cover boundary ties, ensuring smaller rowId 
candidates are retained when scores are equal.
   
   ### Tests
   
     - `mvn -Dmaven.repo.local=/tmp/paimon-m2 -pl paimon-common -am -DskipTests 
spotless:check checkstyle:check`
     - `mvn -Dmaven.repo.local=/tmp/paimon-m2 -pl paimon-common -am 
-DfailIfNoTests=false -Dtest=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]

Reply via email to