A RecordBatch is currently sorted as a one-chunk Table. It is suboptimal as it's paying the chunk resolution cost even though it's not necessary.

A dedicated RecordBatch sort may also form the basis for a faster Table sort (first sort individual batches, then use merge sort along the sorted batches).

Reporter: Antoine Pitrou / @pitrou
Assignee: Antoine Pitrou / @pitrou

Related issues:

• [C++] Investigate Table sort performance (relates to)

PRs and other links:

• GitHub Pull Request #8890

_{Note: This issue was originally created as ARROW-10796. Please see the migration documentation for further details.}