Slightly optimize very short queries with LowCardinality#14129
Slightly optimize very short queries with LowCardinality#14129alexey-milovidov merged 1 commit intoClickHouse:masterfrom
Conversation
|
Look at QPS. After: |
|
Currently it's impossible to add performance test for such short queries. |
|
I've read the fix but I don't understand how it's related to LowCardinality. |
|
@CurtizJ looking forward to this! After your change, is there still a difference with |
The problem appeared, when we read dictionary of low cardinality. Since it has low size, a lot of marks point to one place, and previously we a lot of time was spent in loop, while trying to find mark to next compressed block. |
I can't check it now, because in new versions old code is already removed and |
Backport #14129 to 20.6: Slightly optimize very short queries with LowCardinality
Backport #14129 to 20.5: Slightly optimize very short queries with LowCardinality
Backport #14129 to 20.4: Slightly optimize very short queries with LowCardinality
Backport #14129 to 20.7: Slightly optimize very short queries with LowCardinality
Slightly optimize very short queries with LowCardinality (cherry picked from commit 9baa0fb)
I hereby agree to the terms of the CLA available at: https://yandex.ru/legal/cla/?lang=en
Changelog category (leave one):
Changelog entry (a user-readable short description of the changes that goes to CHANGELOG.md):
Slightly optimize very short queries with LowCardinality.
Resolves #13864.