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

From Yann Michel
Subject Re: plans for bitmap indexes?
Date
Msg-id 20041027144412.GA21431@uff.spline.inf.fu-berlin.de
Whole thread Raw
In response to Re: plans for bitmap indexes?  (Greg Stark <gsstark@mit.edu>)
List pgsql-hackers
Hi,

On Wed, Oct 27, 2004 at 10:13:56AM -0400, Greg Stark wrote:
> 
> There's a logical separation between the idea of index methods and table
> storage mechanisms. Trying to implement something like this that breaks that
> abstraction will only make things far more confusing.
> 
> I think what you're trying to accomplish is better accomplished through
> partitioned tables. Then the user can decide which keys to use to partition
> the data and the optimizer can use the data to completely exclude some
> partitions from consideration. And it wouldn't interfere with indexes to
> access the data within a partition.

this is not always the truth. In datawarehouosing applications you often
use data paritioning (time based) and bitmap indexes for fast
star-transformations. A very efficient way to solve that ist using
bitmap indexes.

Regards,
Yann


pgsql-hackers by date:

Previous
From: Reini Urban
Date:
Subject: src/timezone/pgtz __imp__my_exec_path
Next
From: Andrew Dunstan
Date:
Subject: Re: rmtree() failure on Windows