Bruce Momjian <[EMAIL PROTECTED]> writes:
> Hannu Krosing wrote:
> > Eric Ridge kirjutas R, 09.01.2004 kell 01:16:
> >
> > > Forgetting about composite indexes for a moment, is postgres even
> > > capable of doing 2 index scans in this situation? Does it know how do
> > > take the intersection of two scans?
> >
> > Not currently, but it has been in TODO for quite some time:
> >
> > * Use bitmaps to fetch heap pages in sequential order [performance]
> > * Use bitmaps to combine existing indexes [performance]
>
> And this the foundation of bitmapped indexes, as I understand it, and is
> used for "star" joins, popular with data warehousing.
Actually I think the thinking with those two TODO items is to use these
algorithms in conjunction with regular indexes. Doing regular index scans in
parallel, construct bitmaps, perform logical operations to join them, and then
do the table scan.
It could be done in conjunction with a scheme for storing bitmap indexes or
not. Probably not though.
--
greg
---------------------------(end of broadcast)---------------------------
TIP 3: if posting/reading through Usenet, please send an appropriate
subscribe-nomail command to [EMAIL PROTECTED] so that your
message can get through to the mailing list cleanly
