Re: Failure while inserting parent tuple to B-tree is not fun

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Andres Freund <andres(at)2ndquadrant(dot)com>
Cc: Heikki Linnakangas <hlinnakangas(at)vmware(dot)com>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Failure while inserting parent tuple to B-tree is not fun
Date: 2013-10-22 20:38:05
Message-ID: 5377.1382474285@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Andres Freund <andres(at)2ndquadrant(dot)com> writes:
> On 2013-10-22 15:24:40 -0400, Tom Lane wrote:
>> No, that's hardly a good idea. As Heikki says, that would amount to
>> converting an entirely foreseeable situation into a PANIC.

> But IIUC this can currently lead to an index giving wrong answers, not
> "just" fail at further inserts?

No. It's exactly the same situation as when the insert is still in
progress, ie searches have to move right when following the original
downlink. Go read the nbtree README.

regards, tom lane

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Jaime Casanova 2013-10-22 20:52:20 Re: Commitfest II CLosed
Previous Message Tom Lane 2013-10-22 20:36:22 Re: Reasons not to like asprintf