Re: proposal for smaller indexes on index-ordered tables

From: "Jonah H(dot) Harris" <jonah(dot)harris(at)gmail(dot)com>
To: "Jeffrey Baker" <jwbaker(at)gmail(dot)com>
Cc: pgsql-hackers(at)postgresql(dot)org
Subject: Re: proposal for smaller indexes on index-ordered tables
Date: 2008-06-24 20:50:14
Message-ID: 36e682920806241350o21d77ee3ia2ffa0b1c5b9f03b@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

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. As
such, an index such as this would soon be ineffective. IIRC, Heikki
has done some work on keeping clustered tables clustered, but it
hasn't yet made it into core.

--
Jonah H. Harris, Sr. Software Architect | phone: 732.331.1324
EnterpriseDB Corporation | fax: 732.331.1301
499 Thornall Street, 2nd Floor | jonah(dot)harris(at)enterprisedb(dot)com
Edison, NJ 08837 | http://www.enterprisedb.com/

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message daveg 2008-06-24 20:53:58 Re: [HACKERS] Patch for Prevent pg_dump/pg_restore from being affected by statement_timeout
Previous Message Jeffrey Baker 2008-06-24 20:34:27 proposal for smaller indexes on index-ordered tables