Are you saying that the index is made on columns which only have few unique values so you need to scan everything all the time? Given that you’ve included the

Are you saying that the index is made on columns which only have few unique values so you need to scan everything all the time? Given that you’ve included the log(b) claim I thought you were referring to a normally functioning btree. A situation where 65k rows end up slowing down things severely should have more to do with other database features (foreign keys and similar).