Re: bitmap scans, btree scans, and tid order

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

"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.)

regards, tom lane

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Jeffrey Baker 2005-05-16 06:14:51 Re: bitmap scans, btree scans, and tid order
Previous Message David Fetter 2005-05-16 04:45:30 Re: [Fwd: Re: SQL99 Hierarchical queries]