yjshen commented on issue #2148: URL: https://github.com/apache/arrow-datafusion/issues/2148#issuecomment-1088726007
Hi @jackwener, currently @richox has two efforts trying to achieve this: The first one intended to use `peek_mut` instead of `pop` in SortPreserveMerging for less comparison but seems suffering performance regression at the moment. https://github.com/apache/arrow-datafusion/pull/2134 The second attempt tries to use `BTree` instead of the current `MinHeap` and is still a work in progress. https://github.com/richox/arrow-datafusion/tree/sort_memory_2_peekmut_pop Perhaps you guys could discuss this to see if it's possible to come up with a faster solution? -- 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]
