| From: | Noah Misch <noah(at)leadboat(dot)com> |
|---|---|
| To: | Robert Haas <robertmhaas(at)gmail(dot)com> |
| Cc: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Greg Smith <greg(at)2ndquadrant(dot)com>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Single client performance on trivial SELECTs |
| Date: | 2011-04-14 19:45:26 |
| Message-ID: | 20110414194526.GA5979@tornado.leadboat.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Thu, Apr 14, 2011 at 11:15:00AM -0700, Robert Haas wrote:
> It's fairly far down in the noise on this particular profile, but in
> the low-hanging fruit department, I think we should fix
> ScanKeywordLookup to use a smarter algorithm that is more like O(1)
> rather than O(lg n) in the number of keywords.
+1
> It shouldn't be
> terribly difficult to come up with some kind of hash function based
> on, say, the first two characters of the keyword that would be a lot
> faster than what we're doing now.
I'd look at `gperf', which generates code for this from your keyword list.
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2011-04-14 20:02:50 | Re: Single client performance on trivial SELECTs |
| Previous Message | Heikki Linnakangas | 2011-04-14 19:36:09 | Re: Single client performance on trivial SELECTs |