Re: [PERFORM] Bitmap indexes etc.

2005-12-27 Thread Ivan Voras
On Mon, 26 Dec 2005, Tom Lane wrote: ...snip... Thanks, it's a very good explanation! -- Preserve wildlife -- pickle a squirrel today! ---(end of broadcast)--- TIP 6: explain analyze is your friend

Re: [PERFORM] Bitmap indexes etc.

2005-12-26 Thread Tom Lane
Ivan Voras <[EMAIL PROTECTED]> writes: > This is PostgreSQL 8.1.0. > - what does "Bitmap Heap Scan" phase do? A plain indexscan fetches one tuple-pointer at a time from the index, and immediately visits that tuple in the table. A bitmap scan fetches all the tuple-pointers from the index in one g

[PERFORM] Bitmap indexes etc.

2005-12-26 Thread Ivan Voras
Hi! This is not actually a question about performance, but an inquiry to help me understand what is going on. Below this text are two EXPLAIN ANALYZE outputs, before and after VACUUM ANALYZE was run. I have several questions about the proposed plans (mostly the first one). There is only one ta

Re: [PERFORM] Bitmap indexes

2005-02-02 Thread Daniel Ceregatti
PFC wrote: > > contrib/intarray has an index type which could be what you need. > I've used intarray for a site that requires that I match multiple low cardinality attributes with multiple search criteria. Here's an (abridged) example: The table: \d person_attributes Table

Re: [PERFORM] Bitmap indexes

2005-02-02 Thread Bruce Momjian
PFC wrote: > > There's a great deal about this in the list archives (probably more in > > pgsql-hackers than in -performance). Most of the current interest has > > to do with building in-memory bitmaps on the fly, as a way of decoupling > > index and heap scan processing. Which is not quite what

Re: [PERFORM] Bitmap indexes

2005-01-28 Thread Christopher Browne
[EMAIL PROTECTED] (Alex Turner) writes: > I was wondering about index types. Oracle has an index type called a > 'bitmap' index. They describe this as an index for low cardinality > fields, where only the cardinal values are indexed in a b-tree, and > then it uses a bitmap below that to describe

Re: [PERFORM] Bitmap indexes

2005-01-28 Thread PFC
There's a great deal about this in the list archives (probably more in pgsql-hackers than in -performance). Most of the current interest has to do with building in-memory bitmaps on the fly, as a way of decoupling index and heap scan processing. Which is not quite what you're talking about but sh

Re: [PERFORM] Bitmap indexes

2005-01-28 Thread Tom Lane
Alex Turner <[EMAIL PROTECTED]> writes: > I was wondering about index types. Oracle has an index type called a > 'bitmap' index. There's a great deal about this in the list archives (probably more in pgsql-hackers than in -performance). Most of the current interest has to do with building in-mem

Re: [PERFORM] Bitmap indexes

2005-01-28 Thread PFC
contrib/intarray has an index type which could be what you need. I was wondering about index types. Oracle has an index type called a 'bitmap' index. They describe this as an index for low cardinality fields, where only the cardinal values are indexed in a b-tree, and then it uses a bitmap b

[PERFORM] Bitmap indexes

2005-01-28 Thread Alex Turner
I was wondering about index types. Oracle has an index type called a 'bitmap' index. They describe this as an index for low cardinality fields, where only the cardinal values are indexed in a b-tree, and then it uses a bitmap below that to describe rows. They say that this type of index is very