Jackie-Jiang opened a new pull request, #10357: URL: https://github.com/apache/pinot/pull/10357
Currently for selection order-by queries, when combining multiple segment results, we maintain a heap (PriorityQueue) of the top values, which has time complexity of O(nlogm) where n is the total number of values, and m is the number of top values to be collected. This PR enhances that by using the merge sort which has the time complexity of O(n). Within each segment, we do need to convert the heap to a sorted list, but that can be done parallel. This PR doesn't change the broker side merge logic for backward compatibility. We may optimize the broker side merge after this PR is released. -- 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: commits-unsubscr...@pinot.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: commits-unsubscr...@pinot.apache.org For additional commands, e-mail: commits-h...@pinot.apache.org
