[Enhancement] Improve sort algorithm

[Gabriel39]

Search before asking

• I had searched in the issues and found no similar issues.

Description

Now in sort node, we first do partial sort to get several sorted blocks and then do merge sort to get the final result.

For partial sort, we use heap sort or pdq sort which uses a row-based comparison to sort. However, this row-based comparison is not efficient enough.

Solution

Use a column-based comparison is better, for multiple columns comparison , we do partial sort column by column

Are you willing to submit PR?

• Yes I am willing to submit a PR!

Code of Conduct

• I agree to follow this project's Code of Conduct