From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
---|---|
To: | Greg Smith <greg(at)2ndquadrant(dot)com> |
Cc: | Matthew Wakeling <matthew(at)flymine(dot)org>, Robert Haas <robertmhaas(at)gmail(dot)com>, Eliot Gable <egable+pgsql-performance(at)gmail(dot)com>, pgsql-performance(at)postgresql(dot)org |
Subject: | Re: B-Heaps |
Date: | 2010-06-18 19:41:05 |
Message-ID: | 17236.1276890065@sss.pgh.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-performance |
Greg Smith <greg(at)2ndquadrant(dot)com> writes:
> Your characterization of the potential speed up here is "Using a proper tree
> inside the index page would improve the CPU usage of the index lookups",
> which seems quite reasonable. Regardless, when I consider "is that
> something I have any reason to suspect is a bottleneck on common
> workloads?", I don't think of any, and return to working on one of
> things I already know is instead.
Note also that this doesn't do a thing for b-tree indexes, which already
have an intelligent within-page structure. So that instantly makes it
not a mainstream issue. Perhaps somebody will be motivated to work on
it, but most of us are chasing other things.
regards, tom lane
From | Date | Subject | |
---|---|---|---|
Next Message | Yeb Havinga | 2010-06-18 20:18:41 | Re: B-Heaps |
Previous Message | Kevin Grittner | 2010-06-18 18:44:22 | Re: B-Heaps |