Re: Performance optimization of btree binary search

From: Peter Geoghegan <pg(at)heroku(dot)com>
To: Robert Haas <robertmhaas(at)gmail(dot)com>
Cc: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Pg Hackers <pgsql-hackers(at)postgresql(dot)org>, Stephen Frost <sfrost(at)snowman(dot)net>
Subject: Re: Performance optimization of btree binary search
Date: 2013-12-04 23:33:23
Message-ID: CAM3SWZR1ZVno5YPs1QmTydZMsNnutmUHLnkjJ4x3Lb8a2oueSg@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Wed, Dec 4, 2013 at 1:59 PM, Robert Haas <robertmhaas(at)gmail(dot)com> wrote:
> Yeah, I think if we can make something like this work, it would be
> neat-o. Getting this working for int4 would be a good win, as Peter
> says, but getting it working for both int4 and int8 with the same code
> would be a significantly better one.

No arguments here. I think I didn't initially suggest it myself out of
passing concern about the guarantees around how unused Datum bits are
initialized in all relevant contexts, but having looked at it for a
second I see that we are of course disciplined there.

--
Peter Geoghegan

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Tom Lane 2013-12-04 23:45:47 Re: Performance optimization of btree binary search
Previous Message Tom Dunstan 2013-12-04 23:26:42 Re: Proposed feature: Selective Foreign Keys