B-tree index on a VARCHAR(4000) column

From: Ron Johnson <ron(dot)l(dot)johnson(at)cox(dot)net>
To: "pgsql-general(at)postgresql(dot)org" <pgsql-general(at)postgresql(dot)org>
Subject: B-tree index on a VARCHAR(4000) column
Date: 2017-09-08 03:48:52
Message-ID: 780beb7c-94f3-fed9-9959-73b725632949@cox.net
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

Hi,

v 9.2.7

Based on LENGTH(offending_column), none of the values are more than 144
bytes in this 44.2M row table. Even though VARCHAR is, by definition,
variable length, are there any internal design issues which would make
things more efficient if it were dropped to, for example, VARCHAR(256)?

(I don't have access to the source code or to development boxes, so can't
just test this on my own.)

Thanks,

--
World Peace Through Nuclear Pacification

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Craig Ringer 2017-09-08 04:12:35 Re: BDR, wal segment has been removed, is it possible move forward?
Previous Message Michael Paquier 2017-09-07 23:04:30 Re: pg_rewind issue