Re: Why could different data in a table be processed with different performance?

[Vladimir Ryabtsev]

> If it does an index scan, I think that will badly fail to keep the same
order of heap TIDs - it'll be inserting rows in ID order rather than in (I
guess) reverse ID order.
According to the plan, it's gonna be seq. scan with filter.

Vlad