Uh oh!
There was an error while loading. Please reload this page.
ARROW-10898: [C++] Improve table sort performance - #11262
Closed
pitrou wants to merge 1 commit into
Closed
Conversation
Use the same strategy as for chunked array sorting: - first sort each RecordBatch individually, taking advantage of data contiguity for fast indexing - then merge sorted batches recursively, using slower chunked indexing Benchmarks show up to 200% speedups on some benchmark parameters, along with very minor regressions.
pitrouforce-pushed
the
ARROW-10898-table-merge-sort
branch
from
September 28, 2021 18:54
a24e0eb to
f25bf77Comparepitrou
commented
Sep 28, 2021
MemberAuthor
@ursabot please benchmark |
Benchmark runs are scheduled for baseline = 8dbe574 and contender = f25bf77. Results will be available as each benchmark for each run completes. |
kou
approved these changes
Sep 28, 2021
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for freeto join this conversation on GitHub.
Already have an account?
Sign in to comment
4 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Use the same strategy as for chunked array sorting:
Benchmarks show up to 200% speedups on some benchmark parameters, along with very minor regressions.