From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
---|---|
To: | Claire McLister <mclister(at)zeesource(dot)net> |
Cc: | pgsql-performance(at)postgresql(dot)org |
Subject: | Re: JDBC/Stored procedure performance issue |
Date: | 2008-01-28 20:51:53 |
Message-ID: | 6915.1201553513@sss.pgh.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-performance |
Claire McLister <mclister(at)zeesource(dot)net> writes:
> When I do an EXPLAIN ANALYZE on one query that returns 3261 rows, it
> executes in a reasonable 159ms:
> ...
> If I issue the same query over JDBC or use a PSQL stored procedure, it
> takes over 3000 ms, which, of course is unacceptable!
I suspect that the problem is with "groupid = $1" instead of
"groupid = 57925". The planner is probably avoiding an indexscan
in the parameterized case because it's guessing the actual value will
match so many rows as to make a seqscan faster. Is the distribution
of groupid highly skewed? You might get better results if you increase
the statistics target for that column.
Switching to something newer than 7.4.x might help too. 8.1 and up
support "bitmap" indexscans which work much better for large numbers
of hits, and correspondingly the planner will use one in cases where
it wouldn't use a plain indexscan.
regards, tom lane
From | Date | Subject | |
---|---|---|---|
Next Message | Merlin Moncure | 2008-01-29 02:56:40 | Re: Hard Drive Usage for Speeding up Big Queries |
Previous Message | Arjen van der Meijden | 2008-01-28 20:28:21 | Re: 8x2.5" or 6x3.5" disks |