> a columnar DB will typically produce produce a bitmap from of col2
Bitmaps fell out of fashion after the branch predictor became the slowest part of vectorized execution.
Most columnar dbs use compact selection vectors and loop over the values within them, rather than an if() over each row.
Imagine you had 1024 rows in the col1 column and only 1 row is selected, then this optimization has to only do 3-4 branches before the vector is done vs a bit-map which has to always do 1024 checks.
This became relevant somewhere in the mid 2010s and is called out in the Hive design[1] docs from that era.
[1] - https://issues.apache.org/jira/secure/attachment/12594231/Hi...