Parallel Merge Sort Optimization for Processors

Why it matters

To enhance the efficiency and speed of sorting operations in ClickHouse by leveraging parallelism in the merge sort algorithm, reducing query execution times for large datasets and making better use of processor resources.

How to use it

This optimization is applied internally within ClickHouse's sorting routines. Users benefit from improved performance automatically when executing queries involving ORDER BY clauses or other sorting operations without needing explicit configuration.