[jira] [Updated] (ARROW-1571) [C++] Implement argsort kernels (sort indices) for integers using O(n) counting sort

["Rok Mihevc (Jira)" <ji...@apache.org>]

     [ https://issues.apache.org/jira/browse/ARROW-1571?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Rok Mihevc updated ARROW-1571:
------------------------------
    External issue URL: https://github.com/apache/arrow/issues/17584

> [C++] Implement argsort kernels (sort indices) for integers using O(n) counting sort
> ------------------------------------------------------------------------------------
>
>                 Key: ARROW-1571
>                 URL: https://issues.apache.org/jira/browse/ARROW-1571
>             Project: Apache Arrow
>          Issue Type: New Feature
>          Components: C++
>            Reporter: Wes McKinney
>            Assignee: Yibo Cai
>            Priority: Major
>              Labels: Analytics, pull-request-available
>             Fix For: 0.17.0
>
>         Attachments: e5-2650.png
>
>          Time Spent: 4h 40m
>  Remaining Estimate: 0h
>
> This function requires knowledge of the minimum and maximum of an array. If it is small enough, then an array of size {{maximum - minimum}} can be constructed and used to tabulate value frequencies and then compute the sort indices (this is called "grade up" or "grade down" in APL languages). There is generally a cross-over point where this function performs worse than mergesort or quicksort due to data locality issues



--
This message was sent by Atlassian Jira
(v8.20.10#820010)