In regular b-tree indexes, there is some behavior in cursor seeking here that's necessary because WT::Cursor::search_near() is not guaranteed to return the maximum key that compares lower than the search key. We should determine whether we need equivalent logic for the column index. See here.