From: ohp@pyrenet.fr
To: pgsql-performance@postgresql.org
Subject: index as large as table
Date: Sat, 20 Aug 2005 14:18:29 +0200
Message-ID: <Pine.UW2.4.53.0508201413430.7116@sun.pyrenet> (raw)
Hi,
While testing 8.1dev I came to this:
CREATE TABLE t (
a int,
b int
PRIMARY KEY (a,b));
In that case, the index is as big as the table.
My question is is it worthwhile to have such index peformance wise.
I understand I'd loose uniqness buthas such an index any chance to be used
against seq scan.
Is there any chance we have a "btree table" in the future for that case?
Regards,
--
Olivier PRENANT Tel: +33-5-61-50-97-00 (Work)
15, Chemin des Monges +33-5-61-50-97-01 (Fax)
31190 AUTERIVE +33-6-07-63-80-64 (GSM)
FRANCE Email: ohp@pyrenet.fr
------------------------------------------------------------------------------
Make your life a dream, make your dream a reality. (St Exupery)
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Reply to all the recipients using the --to and --cc options:
reply via email
To: pgsql-performance@postgresql.org
Cc: ohp@pyrenet.fr
Subject: Re: index as large as table
In-Reply-To: <Pine.UW2.4.53.0508201413430.7116@sun.pyrenet>
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox