| From: | John Taylor <postgres(at)jtresponse(dot)co(dot)uk> |
|---|---|
| To: | "PgSQL Novice" <pgsql-novice(at)postgresql(dot)org> |
| Subject: | Optimising inside transactions |
| Date: | 2002-06-12 15:07:26 |
| Message-ID: | 02061216072607.03223@splash.hq.jtresponse.co.uk |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers pgsql-jdbc pgsql-novice |
Hi,
I'm running a transaction with about 1600 INSERTs.
Each INSERT involves a subselect.
I've noticed that if one of the INSERTs fails, the remaining INSERTs run in about
1/2 the time expected.
Is postgresql optimising the inserts, knowing that it will rollback at the end ?
If not, why do the queries run faster after the failure ?
Thanks
JohnT
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2002-06-12 15:36:30 | Re: Optimising inside transactions |
| Previous Message | Michael Meskes | 2002-06-12 14:49:11 | PostgreSQL and Novell Netware |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2002-06-12 15:36:30 | Re: Optimising inside transactions |
| Previous Message | SERFIOTIs gewrgios | 2002-06-12 14:01:55 | Acquiring views |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Henshall, Stuart - WCP | 2002-06-12 15:21:15 | Re: How efficient are Views |
| Previous Message | John Taylor | 2002-06-12 15:02:07 | How efficient are Views |