Re: plans for bitmap indexes? - Mailing list pgsql-hackers

From Hannu Krosing
Subject Re: plans for bitmap indexes?
Date
Msg-id 1098793147.2551.14.camel@fuji.krosing.net
Whole thread Raw
In response to Re: plans for bitmap indexes?  (Mark Kirkwood <markir@coretech.co.nz>)
Responses Re: plans for bitmap indexes?
List pgsql-hackers
On K, 2004-10-20 at 01:52, Mark Kirkwood wrote:

> I don't believe that read only is required. The update/insert 
> performance impact of bimap indexes is however very high (in Oracle's 
> implementation anyway) - to the point where many sites drop them before 
> adding in new data, and recreated 'em afterwards!
> 
> In the advent that there is a benefit for the small on-disk footprint, 
> the insert/update throughput implications will need to be taken into 
> account.

I repeat here my earlier proposal of making the bitmap indexes
page-level and clustering data automatically on AND of all defined
bitmap indexes. 

This would mostly solve this problem too, as there will be only one
insert per page per index (when the first tuple is inserted) and one
delete (when the page gets empty).

This has a downside of suboptimal space usage but this "should not" (tm)
be an issue for large tables, where most combinations of bits will get
enough hits to fill several pages.

Such clustering would also help (probably a lot) all queries actually
using these indexes.

-------------
Hannu


pgsql-hackers by date:

Previous
From: Bernd Helmle
Date:
Subject: Re: Automatic view update rules
Next
From: Simon Riggs
Date:
Subject: Re: [PATCHES] ARC Memory Usage analysis