You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
BTW, once I noticed that set is 4 times slower than minmax with the same data.
set max_threads=1;
createtableind_minmax(A Int64, B Int64, index x1 B type minmax granularity 1)
Engine MergeTree order by A asselectnumber, cityHash64(number)%111111=1from numbers(1e8);
optimize table ind_minmax final;
createtableind_set(A Int64, B Int64, index x1 B type set(2) granularity 1)
Engine MergeTree order by A asselectnumber, cityHash64(number)%111111=1from numbers(1e8);
optimize table ind_set final;
selectcount() from ind_minmax where B =1;
Elapsed: 0.015 sec. Processed 7.26 million rows
selectcount() from ind_set where B =1;
Elapsed: 0.060 sec. Processed 7.26 million rows
droptable ind_set;
droptable ind_minmax;
0.015 sec vs 0.060 sec
because we check predicate against all set elements. it is known sub-optimality (lack of min-max for set)
because we check predicate against all set elements. it is known sub-optimality (lack of min-max for set)
Originally posted by @nickitat in #64098 (comment)
The text was updated successfully, but these errors were encountered: