Re: bitmap scans, btree scans, and tid order - Mailing list pgsql-hackers

From Tom Lane
Subject Re: bitmap scans, btree scans, and tid order
Date
Msg-id 9050.1116219532@sss.pgh.pa.us
Whole thread Raw
In response to bitmap scans, btree scans, and tid order  ("Jeffrey W. Baker" <jwbaker@acm.org>)
Responses Re: bitmap scans, btree scans, and tid order  (Jeffrey Baker <jwbaker@acm.org>)
Re: bitmap scans, btree scans, and tid order  (Greg Stark <gsstark@mit.edu>)
List pgsql-hackers
"Jeffrey W. Baker" <jwbaker@acm.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.)
        regards, tom lane


pgsql-hackers by date:

Previous
From: David Fetter
Date:
Subject: Re: [Fwd: Re: SQL99 Hierarchical queries]
Next
From: Jeffrey Baker
Date:
Subject: Re: bitmap scans, btree scans, and tid order