| From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
|---|---|
| To: | Greg Smith <gsmith(at)gregsmith(dot)com> |
| Cc: | Aidan Van Dyk <aidan(at)highrise(dot)ca>, Robert Haas <robertmhaas(at)gmail(dot)com>, Simon Riggs <simon(at)2ndquadrant(dot)com>, "Dickson S(dot) Guedes" <listas(at)guedesoft(dot)net>, jd(at)commandprompt(dot)com, pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: Patch to fix search_path defencies with pg_bench |
| Date: | 2009-05-08 00:11:08 |
| Message-ID: | 7736.1241741468@sss.pgh.pa.us |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Greg Smith <gsmith(at)gregsmith(dot)com> writes:
> On Thu, 7 May 2009, Aidan Van Dyk wrote:
> You are correct here. Right now, pgbench is guaranteed to be running
> against a search_path with only one entry in it. If someone runs the new
> version against a configuration with something like:
> search_path='a,b,c,d,e,f,g,h,i,j,public'
> instead, that is going to execute more slowly than the current pgbench
> would have.
No, it is not. The tables will be created and used in schema 'a',
and the effective search path depth will be the same.
regards, tom lane
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Josh Berkus | 2009-05-08 01:14:18 | [Fwd: congratulations on 8.4 beta] |
| Previous Message | Greg Smith | 2009-05-08 00:07:37 | Re: Patch to fix search_path defencies with pg_bench |