From: | Hannu Krosing <hannu(at)2ndQuadrant(dot)com> |
---|---|
To: | Andres Freund <andres(at)2ndquadrant(dot)com> |
Cc: | Heikki Linnakangas <hlinnakangas(at)vmware(dot)com>, Kevin Grittner <kgrittn(at)ymail(dot)com>, PostgreSQL-development <pgsql-hackers(at)postgreSQL(dot)org> |
Subject: | Re: SSI freezing bug |
Date: | 2013-09-21 21:12:25 |
Message-ID: | 523E0BB9.1040509@2ndQuadrant.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On 09/21/2013 10:46 PM, Andres Freund wrote:
>
> Heikki Linnakangas <hlinnakangas(at)vmware(dot)com> schrieb:
>> Kevin Grittner <kgrittn(at)ymail(dot)com> wrote:
>>> Andres Freund <andres(at)2ndquadrant(dot)com> wrote:
>>>>> On 2013-09-20 13:55:36 +0300, Heikki Linnakangas wrote:
>>>>>> When a tuple is predicate-locked, the key of the lock is
>> ctid+xmin.
>>>>>> However, when a tuple is frozen, its xmin is changed to FrozenXid.
>>> That
>>>>>> effectively
>>>>>> invalidates any predicate lock on the tuple, as checking for a
>> lock
>>> on
>>>>>> the
>>>>>> same tuple later won't find it as the xmin is different.
>>>>>>
>>>>>> Attached is an isolationtester spec to demonstrate this.
>>>>> Do you have any idea to fix that besides keeping the xmin horizon
>>> below the
>>>>> lowest of the xids that are predicate locked? Which seems nasty to
>>>>> compute and is probably not trivial to fit into the procarray.c
>>>>> machinery?
>>>> A better solution probably is to promote tuple-level locks if they
>>> exist
>>>> to a relation level one upon freezing I guess?
>>> That would work. A couple other ideas would be to use the oldest
>>> serializable xmin which is being calculated in predicate.c to
>>> either prevent freezing of newer transaction or to summarize
>>> predicate locks (using the existing SLRU-based summarization
>>> functions) which use xmin values for xids which are being frozen.
>>> The transactions must already be committed, and so are eligible for
>>> summarization.
>> What's the point of using xmin as part of the lock key in the first
>> place, wouldn't ctid alone suffice? If the tuple was visible to the
>> reading transaction, it cannot be vacuumed away until the transaction
>> commits. No other tuple can appear with the same ctid.
> SSI locks can live longer than one TX/snapshot.
But the only way that ctid can change without xmin changing is when
you update the tuple in the same TX that created it.
Could it be the case here or can we safely exclude this ?
--
Hannu Krosing
PostgreSQL Consultant
Performance, Scalability and High Availability
2ndQuadrant Nordic OÜ
From | Date | Subject | |
---|---|---|---|
Next Message | Jaime Casanova | 2013-09-21 22:16:42 | Re: Assertions in PL/PgSQL |
Previous Message | Heikki Linnakangas | 2013-09-21 20:46:18 | Re: SSI freezing bug |