Re: B-tree descend for insertion locking

From: Peter Geoghegan <pg(at)heroku(dot)com>
To: Heikki Linnakangas <hlinnakangas(at)vmware(dot)com>
Cc: PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: B-tree descend for insertion locking
Date: 2014-09-04 00:11:56
Message-ID: CAM3SWZSfGmDWA-=HPR=peop3B-damQ1N2TZtOO+UxujH2VYLSA@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Tue, Mar 18, 2014 at 4:12 AM, Heikki Linnakangas
<hlinnakangas(at)vmware(dot)com> wrote:
> When inserting into a B-tree index, all the pages are read-locked when
> descending the tree. When we reach the leaf page, the read-lock is exchanged
> for a write-lock.
>
> There's nothing wrong with that, but why don't we just directly grab a
> write-lock on the leaf page?

Whatever happened to this idea?

--
Peter Geoghegan

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Bruce Momjian 2014-09-04 00:33:31 Re: Display of timestamp in pg_dump custom format
Previous Message Hannu Krosing 2014-09-04 00:10:26 Re: PL/pgSQL 1.2