Re: B-tree parent pointer and checkpoints

Heikki Linnakangas <heikki.linnakangas@enterprisedb.com>

From: Heikki Linnakangas <heikki.linnakangas@enterprisedb.com>
To: Bruce Momjian <bruce@momjian.us>
Cc: Greg Stark <gsstark@mit.edu>, Tom Lane <tgl@sss.pgh.pa.us>, Teodor Sigaev <teodor@sigaev.ru>, PostgreSQL-development <pgsql-hackers@postgresql.org>, Oleg Bartunov <oleg@sai.msu.su>
Date: 2011-03-11T11:26:41Z
Lists: pgsql-hackers

Commits

Same data as JSON: GET /api/v1/messages/:b64id/commits the thread's linked commits as JSON, with link sources. API reference →
  1. Rewrite the GiST insertion logic so that we don't need the post-recovery

On 10.03.2011 22:50, Bruce Momjian wrote:
> Bruce Momjian wrote:
>>
>> Has this been addressed?
>
> I see we have with this commit:
>
> 	9de3aa65f01fb51cbc725e8508ea233e4e92c46c

We fixed GiST. B-tree still has the issue that if you have a checkpoint 
in the middle of an insert, and crash, you might be left with a leaf 
node without a downlink in the parent.

That's relatively harmless, index searches and insertions work without 
the downlink. However, there's code in page deletion that ERRORs if the 
parent can't be found. That should be fixed.

-- 
   Heikki Linnakangas
   EnterpriseDB   http://www.enterprisedb.com