Usage: 30kB
-> Seq Scan on job s0_m1_mjob (cost=0.00..12.00 rows=500
width=27) (actual time=0.003..0.071 rows=500 loops=1)
Total runtime: 0.818 ms
Great work,
Nick Hofstede
-Original Message-
From: Tom Lane [mailto:t...@sss.pgh.pa.us]
Sent: woensdag 3 oktober 2012 5:
varying(200),
delivery_mformat character varying(200),
delivery_mtype character varying(200),
client_memailaddress character varying(200),
client_mcollectivity character varying(200),
client_mcommunication_mpreference character varying(200),
validated character varying(200),
status ch
Interesting.
Thanks for the work-around.
Regards,
Nick
-Original Message-
From: pgsql-performance-ow...@postgresql.org
[mailto:pgsql-performance-ow...@postgresql.org] On Behalf Of Tom Lane
Sent: donderdag 19 juli 2012 0:36
To: Nick Hofstede
Cc: pgsql-performance@postgresql.org
Subject
Verzonden: woensdag 18 juli 2012 20:40
Aan: Nick Hofstede
CC: pgsql-performance@postgresql.org
Onderwerp: Re: [PERFORM] optimizing queries using IN and EXISTS
On 18 July 2012 17:10, Nick Hofstede wrote:
> Hi,
>
> I'm surprised at the difference in speed/execution plan between two logical
g foo_pkey on foo foo2 (cost=0.00..8.28
rows=1 width=4) (actual time=0.002..0.003 rows=1 loops=1)"
"Index Cond: (id = bar.foo_ref)"
" -> Index Scan using foo_pkey on foo (cost=0.00..8.28 rows=1 width=4)
(actual time=0.001..0.002 rows=1 loops=1)"
