You are viewing a plain text version of this content. The canonical link for it is here.

Posted to jira@arrow.apache.org by "Kirill Lykov (Jira)" <ji...@apache.org> on 2021/02/05 18:23:00 UTC

[jira] [Commented] (ARROW-10899) [C++] Investigate radix sort for integer arrays

    [ https://issues.apache.org/jira/browse/ARROW-10899?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17279881#comment-17279881 ] 

Kirill Lykov commented on ARROW-10899:
--------------------------------------

Sounds interesting to me, I would like to have a look. Could give some more details from where to start? I mean:
* where exactly this sorting happens,
* are there existing benchmarks for this sorting (if not, what is the best place to add them)

> [C++] Investigate radix sort for integer arrays
> -----------------------------------------------
>
>                 Key: ARROW-10899
>                 URL: https://issues.apache.org/jira/browse/ARROW-10899
>             Project: Apache Arrow
>          Issue Type: Wish
>          Components: C++
>            Reporter: Antoine Pitrou
>            Priority: Major
>
> For integer arrays with a non-tiny range of values, we currently use a stable sort. It may be faster to use a radix sort instead.



--
This message was sent by Atlassian Jira
(v8.3.4#803005)