Re: Performance optimization of btree binary search

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Peter Eisentraut <peter_e(at)gmx(dot)net>
Cc: Robert Haas <robertmhaas(at)gmail(dot)com>, Peter Geoghegan <pg(at)heroku(dot)com>, 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-05 05:30:22
Message-ID: 3422.1386221422@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Peter Eisentraut <peter_e(at)gmx(dot)net> writes:
> On Wed, 2013-12-04 at 20:27 -0500, Tom Lane wrote:
>> Lazy people? I'm not in a hurry to drop it; it's not costing us much to
>> just sit there, other than in this connection which we see how to fix.

> Actually, I think it probably costs a fair portion of extension authors
> when their initial code crashes because they forgot to declare all their
> functions V1. I think it might actually be more of a bother to lazy
> people than a benefit.

Hm. We have heard one or two complaints like that, but not a huge number.

I'm worried about breaking code that's been working since god-knows-when;
but I will concede there's little evidence that there's very much of that
out there either.

regards, tom lane

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Jeff Davis 2013-12-05 05:39:56 Re: Extension Templates S03E11
Previous Message Peter Eisentraut 2013-12-05 05:17:59 Re: Proof of concept: standalone backend with full FE/BE protocol