I am making the assumption that when a table is created, it is always a heap. Is this in fact true ? If so, then the only way to get keyed access is through the use of an index. I use Ingres at work and it is great being able to change the structure of a table so that another index isn't needed. i.e. create table x ( key varchar(8), value varchar(64)); modify x to btree on x; Is something similiar possible in Postgresql, if not, are there any plans to implement something similiar. -- =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= Glen Eustace, on behalf of GodZone Internet Services, a division of AGRE Enterprises Limited 176 Te Awe Awe Street, Palmerston North, New Zealand Ph: +64 6 356 2562, Fax: +64 6 357 0271 http://www.godzone.net.nz, EMail: [EMAIL PROTECTED], ICQ: 10397208 =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
