Re: [PERFORM] Creating indexes
On May 9, 1:49 am, [EMAIL PROTECTED] (Asche) wrote: > Hi, > > > Hi, all. I want to ask what type of index is better to create for > > bigint types. I have table with bigint (bigserial) primary key. What > > http://www.postgresql.org/docs/8.3/static/sql-createtable.html > > PostgreSQL automatically creates an index for each unique constraint > and primary key constraint to enforce uniqueness. Thus, it is not > necessary to create an index explicitly for primary key columns. > > > type is better to use for it? I tried btree and hash, but didn't > > You already have an index on your bigint primary key. I think it is of > type btree. > > Jan Aah, I understand. Thanks to all for detailed response. -- Sent via pgsql-performance mailing list (pgsql-performance@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-performance
Re: [PERFORM] Creating indexes
Hi, Hi, all. I want to ask what type of index is better to create for bigint types. I have table with bigint (bigserial) primary key. What http://www.postgresql.org/docs/8.3/static/sql-createtable.html PostgreSQL automatically creates an index for each unique constraint and primary key constraint to enforce uniqueness. Thus, it is not necessary to create an index explicitly for primary key columns. type is better to use for it? I tried btree and hash, but didn't You already have an index on your bigint primary key. I think it is of type btree. Jan
Re: [PERFORM] Creating indexes
Hi, all. I want to ask what type of index is better to create for bigint types. I have table with bigint (bigserial) primary key. What type is better to use for it? I tried btree and hash, but didn't notice any differences in execution time. For GiST and GIN there is a trouble that I must create operator class, so I limited myself to use btree or hash. But if it's better to use gist or gin, coment are welcome. If you use BIGINT, I presume you will have lots of different values, in that case the best one is the btree. It is the most common and most optimized index type. GiST's strength is in using indexes for stuff that can't be done with a simple btree : geometry, full text, ltree, etc, but gist is slower in the case of indexing a simple value. GIN indexes are more compact and very fast for reads but updating is very slow (they are meant for mostly read-only tables). Hash is a bit of a fossil. Also it does not support range queries, so if you need that, btree is definitely better. -- Sent via pgsql-performance mailing list (pgsql-performance@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-performance
Re: [PERFORM] Creating indexes
On Thursday 08 May 2008, Rauan Maemirov <[EMAIL PROTECTED]> wrote: > Hi, all. I want to ask what type of index is better to create for > bigint types. I have table with bigint (bigserial) primary key. What > type is better to use for it? I tried btree and hash, but didn't > notice any differences in execution time. A primary key is a unique btree index, and it's as about as good as it gets for a bigint. -- Alan signature.asc Description: This is a digitally signed message part.
[PERFORM] Creating indexes
Hi, all. I want to ask what type of index is better to create for bigint types. I have table with bigint (bigserial) primary key. What type is better to use for it? I tried btree and hash, but didn't notice any differences in execution time. For GiST and GIN there is a trouble that I must create operator class, so I limited myself to use btree or hash. But if it's better to use gist or gin, coment are welcome. -- Sent via pgsql-performance mailing list (pgsql-performance@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-performance
