pitrou opened a new issue, #44084: URL: https://github.com/apache/arrow/issues/44084
### Describe the enhancement requested In the chunked sort kernels (for ChunkedArray and Table), the most expensive step can be the recursive merge of sorted chunks after each individual chunk was sorted. Currently, this merge step resolves chunked indices every time an access is made to read a value. This means chunked resolution is computed `O(n*log2(k))` times (where `n` is the input length and `k` is the number of chunks). _However_, we could instead compute chunked indices after sorting the individual chunks. Then there would be no chunk resolution when merging, just direct accesses through `ResolvedChunk`s. ### Component(s) C++ -- 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: issues-unsubscr...@arrow.apache.org.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org
