Re: proposal for smaller indexes on index-ordered tables

From: "Jaime Casanova" <jcasanov(at)systemguards(dot)com(dot)ec>
To: "Jonah H(dot) Harris" <jonah(dot)harris(at)gmail(dot)com>
Cc: "Jeffrey Baker" <jwbaker(at)gmail(dot)com>, pgsql-hackers(at)postgresql(dot)org
Subject: Re: proposal for smaller indexes on index-ordered tables
Date: 2008-06-25 00:17:58
Message-ID: 3073cc9b0806241717n51961bf8we0a5200225a8338c@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Tue, Jun 24, 2008 at 3:50 PM, Jonah H. Harris <jonah(dot)harris(at)gmail(dot)com> wrote:
> On Tue, Jun 24, 2008 at 4:34 PM, Jeffrey Baker <jwbaker(at)gmail(dot)com> wrote:
>> Supposing the table is generally or strictly ordered by the column to be
>> indexed, it would be more compact if the index stored ranges of tuples.
>> Instead of storing the TID of every tuple with that value, the index would
>> store a first and last TID, between which all tuples have the value.
>
> There are several databases which implement this idea. Unfortunately,
> Postgres does not yet ensure that indexed tables remain indexed.
>

Just for the records. you mean *ordered* tables, don't you?
Postgres does not yet ensure that ordered tables remain ordered.

--
regards,
Jaime Casanova
Soporte y capacitación de PostgreSQL
Guayaquil - Ecuador
Cel. (593) 87171157

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Hiroshi Saito 2008-06-25 00:31:11 Re: MSVC 2003 compile error with pg8.3.3
Previous Message daveg 2008-06-25 00:01:03 Re: [HACKERS] Patch for Prevent pg_dump/pg_restore from being affected by statement_timeout