Re: B-tree parent pointer and checkpoints

From: Greg Stark <gsstark(at)mit(dot)edu>
To: Heikki Linnakangas <heikki(dot)linnakangas(at)enterprisedb(dot)com>
Cc: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Teodor Sigaev <teodor(at)sigaev(dot)ru>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org>, Oleg Bartunov <oleg(at)sai(dot)msu(dot)su>
Subject: Re: B-tree parent pointer and checkpoints
Date: 2010-11-12 22:34:51
Message-ID: AANLkTi=e356WpMC4w=btYdAC5RBWQFnBxnrodmURjwYK@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Fri, Nov 12, 2010 at 7:20 PM, Heikki Linnakangas
<heikki(dot)linnakangas(at)enterprisedb(dot)com> wrote:
> I think we can work around that with a small modification to the page split
> algorithm. In a nutshell, when the child page is split, put a flag on the
> left half indicating that the rightlink must always be followed, regardless
> of the NSN. When the downlink is inserted to the parent, clear the flag.
> Setting and clearing of these flags need to be performed during WAL replay
> as well.
>

Does this not cause duplicate results? Or does GIST already have to be
prepared to deal with duplicate results?

--
greg

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Jeff Davis 2010-11-12 23:12:04 Re: Refactoring the Type System
Previous Message Joshua D. Drake 2010-11-12 22:34:01 Re: WIP: extensible enums