[
https://issues.apache.org/jira/browse/ARROW-10899?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17318707#comment-17318707
]
Kirill Lykov edited comment on ARROW-10899 at 4/11/21, 9:41 AM:
----------------------------------------------------------------
Thanks for the reference to the blog, I read all of his posts.
I've checked with my benchmarks Travis' final radix_sort7 version, see below.
It kind of rocks (at least with uniform distributed data)!
!all_random_wholeRange.png|height=350,width=350!
There is no license file in his repo, so I cannot share my experiments.
There might be several ways to proceed. It looks it would be good to ask Travis
to contribute to Arrow. What do you think?
I've added issue to his repo to add license, see
https://github.com/travisdowns/sort-bench/issues/1
was (Author: klykov):
Thanks for the reference to the blog, I read all of his posts.
I've checked with my benchmarks Travis' final radix_sort7 version, see below.
It kind of rocks (at least with uniform distributed data)!
!all_random_wholeRange.png|height=350,width=350!
There is no license file in his repo, so I cannot share my experiments.
There might be several ways to proceed. It looks it would be good to ask Travis
to contribute to Arrow, which will require some more benchmarking, testing and
code polishing. What do you think?
> [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
> Attachments: Screen Shot 2021-02-09 at 17.48.13.png, Screen Shot
> 2021-02-10 at 10.58.23.png, all_random_wholeRange.png
>
>
> 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)
