Re: REINDEX vs broken HOT chains, redux

From: Greg Stark <gsstark(at)mit(dot)edu>
To: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
Cc: pgsql-hackers(at)postgresql(dot)org
Subject: Re: REINDEX vs broken HOT chains, redux
Date: 2011-04-20 05:16:35
Message-ID: BANLkTimfXsDnT3OSyxDJU9yf1iMftp_B+w@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Tue, Apr 19, 2011 at 4:29 PM, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> wrote:
>  Namely, that when reindexing an
> existing index, there cannot be any need to advance the index's
> indcheckxmin horizon.

Note that if isvalid is not set then we don't know anything about the
hot chains since the concurrent index build never finished.

I'm also a bit concerned since the part of the use case of REINDEX is
for handling precisely the situations where the index is corrupt. If I
change the code for my user-defined data type and knowingly break the
semantics of the btree op, I might reasonably expect a REINDEX to fix
it up. ((I don't recall if we went with binary equality or btree
equality for determining of updates are eligible for hot updates or
not though.)

--
greg

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Pavel Stehule 2011-04-20 06:05:07 Re: pgbench \for or similar loop
Previous Message Robert Haas 2011-04-20 03:50:23 pgindent weirdness