Marc Munro <[EMAIL PROTECTED]> writes: > Consider a table C containing 2 child records C1 and C2, of parent P. > If transaction T1 updates C1 and C2, the locking order of the the > records will be C1, P, C2. Another transaction, T2, that attempts to > update only C2, will lock the records in order C2, P.
> The locks on C2 and P are taken in different orders by the two > transactions, leading to the possibility of deadlock. But the lock on P is shared, hence no deadlock. regards, tom lane ---------------------------(end of broadcast)--------------------------- TIP 1: if posting/reading through Usenet, please send an appropriate subscribe-nomail command to [EMAIL PROTECTED] so that your message can get through to the mailing list cleanly