ClickHouse's Merge Join Skips Whole Runs: A Fused Compare-and-Run-Search Call and an Index Map
ClickHouse’s merge join advances two sorted cursors in lockstep and uses a fused compare-and-run-search to skip whole equal-key runs.
ClickHouse’s merge join advances two sorted cursors in lockstep and uses a fused compare-and-run-search to skip whole equal-key runs.
The ClickHouse hash join keeps the right table as blocks and stores one tagged 64-bit row word per hash-table cell.
ClickHouse’s filesystem cache stores remote objects as size-encoded local segment files ordered by an in-memory LRU.
ClickHouse’s encrypted disk prepends a self-describing 64-byte header and AES-CTRs the payload beneath it.
A MergeTree part is written to a temp directory through a stack of write buffers and published by one atomic directory rename.