ClickHouse / ClickHouse/ClickHouse
Enforce higher pipeline parallelism of later plan steps when the number of reading streams is low
Open
comp-aggregation
performance
- Dominant language
- C++
- Stars
- 49.9k
- Forks
- 9k
- Avg merge
- 21h 32m
- Merged PRs (30d)
- 515
Description
Noticeable when there are not so many rows with heavy aggregate function states. Because we create as many AggregatingTransforms as there are input reading streams we deteriorate performance (more granular parallelisation would be in fact useful since processing of each row is computationally nontrivial).
Contributor guide
Assessment
This issue has not been assessed yet.