On Wed, 24 Aug 2005, Tom Lane wrote:
>> * Fetch heap pages matching index entries in sequential order
>>
>> Rather than randomly accessing heap pages based on index entries, mark
>> heap pages needing access in a bitmap and do the lookups in sequential
>> order. Another method would be to sort heap ctids matching the index
>> before accessing the heap rows.
>
> This is done (see bitmap index scans).
>
Will the optimizer ever choose this plan when dealing with only one index?
Kris Jurka
