ClickHouse Prunes Granules with a Bloom Filter Skip Index
ClickHouse’s bloom_filter skip index keeps one bitset per granule and derives k bit positions from one 64-bit hash.
ClickHouse’s bloom_filter skip index keeps one bitset per granule and derives k bit positions from one 64-bit hash.
ClickHouse analyses a regexp before running it, and often never runs RE2 at all.
ClickHouse shares a global CPU-slot budget between queries with a max-min-fair scheduler, where each query’s slot ceiling is mutable and raised only when the pipeline finds real …
The ClickHouse hash join keeps the right table as blocks and stores one tagged 64-bit row word per hash-table cell.
ClickHouse’s merge join advances two sorted cursors in lockstep and uses a fused compare-and-run-search to skip whole equal-key runs.