lidavidm commented on pull request #11019: URL: https://github.com/apache/arrow/pull/11019#issuecomment-914320553
Thanks for the benchmarks. It looks like the stable heap is about the same or perhaps slightly slower than just sorting and slicing, which is unfortunate. > Hmm, why not, but sort_indices and partition_nth_indices are guaranteed to be stable, so it would be better if topK/bottomK wasn't inconsistent. Since the unstable version is quite a bit faster so far here, maybe we should expose a `select_k_unstable`? (Was the reason why we don't have an unstable sort because it's not useful and/or wasn't meaningfully faster?) -- 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]
