v.24.9Experimental Feature

Improved Algorithmic Complexity for Part Deduplication in Parallel Replica Announcement Handling

Official CH changelog text
Previously the algorithmic complexity of part deduplication logic in parallel replica announcement handling was O(n^2) which could take noticeable time for tables with many part (or partitions). This change makes the complexity O(n*log(n)). #69596 (Alexander Gololobov).
Improved the algorithmic complexity of part deduplication logic in parallel replica announcement handling from O(n²) to O(n log n) to enhance performance for tables with many parts or partitions.

Why it matters

The previous O(n²) complexity caused noticeable delays in processing tables with numerous parts or partitions during parallel replica announcements. This improvement reduces the processing time significantly, enabling faster and more efficient replication handling in such scenarios.

How to use it

This optimization is applied internally in the parallel replica announcement handling mechanism and requires no action from users. Users will benefit from improved replication performance automatically after upgrading to the version containing this change.

Related resources

PreviousNext