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)
---------------------------(end of broadcast)---------------------------
TIP 1: if posting/reading through Usenet, please send an appropriate
subscribe-nomail command to [EMAIL PROTECTED] so that your
message can get through to the mailing list cleanly
