Skip site navigation (1) Skip section navigation (2)

Optimising inside transactions

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 (view raw or flat)
Thread:
Lists: pgsql-hackerspgsql-jdbcpgsql-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

Responses

pgsql-novice by date

Next:From: Henshall, Stuart - WCPDate: 2002-06-12 15:21:15
Subject: Re: How efficient are Views
Previous:From: John TaylorDate: 2002-06-12 15:02:07
Subject: How efficient are Views

pgsql-hackers by date

Next:From: Tom LaneDate: 2002-06-12 15:36:30
Subject: Re: Optimising inside transactions
Previous:From: Michael MeskesDate: 2002-06-12 14:49:11
Subject: PostgreSQL and Novell Netware

pgsql-jdbc by date

Next:From: Tom LaneDate: 2002-06-12 15:36:30
Subject: Re: Optimising inside transactions
Previous:From: SERFIOTIs gewrgiosDate: 2002-06-12 14:01:55
Subject: Acquiring views

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group