Re: plans for bitmap indexes?
От | Hannu Krosing |
---|---|
Тема | Re: plans for bitmap indexes? |
Дата | |
Msg-id | 1098793147.2551.14.camel@fuji.krosing.net обсуждение исходный текст |
Ответ на | Re: plans for bitmap indexes? (Mark Kirkwood <markir@coretech.co.nz>) |
Ответы |
Re: plans for bitmap indexes?
|
Список | 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 по дате отправления: