Re: bitmap scans, btree scans, and tid order

From: Jeffrey Baker <jwbaker(at)acm(dot)org>
To: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
Cc: pgsql-hackers(at)postgresql(dot)org
Subject: Re: bitmap scans, btree scans, and tid order
Date: 2005-05-16 06:14:51
Message-ID: 42883A5B.10901@acm.org
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Tom Lane wrote:
> "Jeffrey W. Baker" <jwbaker(at)acm(dot)org> writes:
>
>>I see that Tom has already done the infrastructure work by adding
>>getmulti, but getmulti isn't used by nodeIndexscan.c, only
>>nodeBitmapIndexscan.c. Will btree index scans be executed by creating
>>in-memory bitmaps in 8.1, or will some scans still be executed the usual
>>way?
>
>
> We aren't going to remove the existing indexscan behavior, because
> bitmap scans lose the ordering of the underlying index. There are many
> situations where that ordering is important. (See for instance the
> recent changes to make MAX/MIN use that behavior.)

Would you take a patch that retained the optimized executions of plans
returning 1 tuple and also fixed the random heap problem?

-jwb

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Neil Conway 2005-05-16 06:35:32 Re: bitmap scans, btree scans, and tid order
Previous Message Tom Lane 2005-05-16 04:58:52 Re: bitmap scans, btree scans, and tid order