From c67c04b89a319cc3d0bcbcc7c3eea169b49d96f5 Mon Sep 17 00:00:00 2001 From: Arthur Passos Date: Mon, 18 Mar 2024 13:44:36 -0300 Subject: [PATCH] fix typo --- src/Storages/MergeTree/SimpleMergeSelector.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/Storages/MergeTree/SimpleMergeSelector.h b/src/Storages/MergeTree/SimpleMergeSelector.h index c20eaa6e8de..a12b8ba48cb 100644 --- a/src/Storages/MergeTree/SimpleMergeSelector.h +++ b/src/Storages/MergeTree/SimpleMergeSelector.h @@ -26,7 +26,7 @@ Then we need some balance between optimization of these two metrics. But some optimizations may improve both metrics. For example, we can look at the "merge tree" - the tree of data parts that were merged. -If the tree is perfectly balanced then its depth is proportonal to the log(data size), +If the tree is perfectly balanced then its depth is proportional to the log(data size), the total amount of work is proportional to data_size * log(data_size) and the write amplification is proportional to log(data_size). If it's not balanced (e.g. every new data part is always merged with existing data parts),