Re: Performance optimization of btree binary search - Mailing list pgsql-hackers

From Peter Geoghegan
Subject Re: Performance optimization of btree binary search
Date
Msg-id CAM3SWZRyF2uD6p8n=7PB2qSgc8L9JvchBgG86po83-5nX68zGA@mail.gmail.com
Whole thread Raw
In response to Performance optimization of btree binary search  (Peter Geoghegan <pg@heroku.com>)
Responses Re: Performance optimization of btree binary search
Re: Performance optimization of btree binary search
List pgsql-hackers
On Wed, Dec 4, 2013 at 12:58 PM, Peter Geoghegan <pg@heroku.com> wrote:
> I'm kind of
> curious as to what this benchmark would like like on a server with
> many more cores.

I'm also curious about the impact on insertion into primary key
indexes. Presently, we hold an exclusive buffer lock for the duration
of a couple of operations when checkUnique != UNIQUE_CHECK_NO.
_bt_binsrch() is one such operation. The other one there,
_bt_check_unique(), is likely to be a lot cheaper than _bt_binsrch()
on average, I think, so I'm cautiously optimistic that it'll be
noticeable. I better go and check it out.


-- 
Peter Geoghegan



pgsql-hackers by date:

Previous
From: Tom Lane
Date:
Subject: Re: Performance optimization of btree binary search
Next
From: Tatsuo Ishii
Date:
Subject: Re: Proposal: variant of regclass