| From: | Andres Freund <andres(at)anarazel(dot)de> |
|---|---|
| To: | Peter Geoghegan <pg(at)heroku(dot)com> |
| Cc: | Heikki Linnakangas <hlinnaka(at)iki(dot)fi>, Pg Hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: memory layouts for binary search in nbtree |
| Date: | 2017-06-27 18:05:36 |
| Message-ID: | 20170627180536.j2frg4fo4fxv7ori@alap3.anarazel.de |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On 2016-05-19 19:38:02 -0700, Peter Geoghegan wrote:
> On Wed, May 18, 2016 at 6:25 AM, Andres Freund <andres(at)anarazel(dot)de> wrote:
> > currently we IIRC use linearly sorted datums for the search in
> > individual btree nodes. Not surprisingly that's often one of the
> > dominant entries in profiles. We could probably improve upon that by
> > using an order more optimized for efficient binary search.
>
> Did you ever try running a pgbench SELECT benchmark, having modified
> things such that all PKs are on columns that are not of type
> int4/int8, but rather are of type numeric? It's an interesting
> experiment, that I've been meaning to re-run on a big box.
> Obviously this will be slower than an equivalent plain pgbench SELECT,
> but the difference may be smaller than you expect.
I'm not sure what that has to do with the topic?
- Andres
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Peter Geoghegan | 2017-06-27 18:13:38 | Re: memory layouts for binary search in nbtree |
| Previous Message | Andres Freund | 2017-06-27 18:04:54 | Re: memory layouts for binary search in nbtree |