Re: Low hanging fruit in lazy-XID-assignment patch?

From: Gregory Stark <stark(at)enterprisedb(dot)com>
To: "Josh Berkus" <josh(at)agliodbs(dot)com>
Cc: <pgsql-hackers(at)postgresql(dot)org>, "Tom Lane" <tgl(at)sss(dot)pgh(dot)pa(dot)us>, "Alvaro Herrera" <alvherre(at)commandprompt(dot)com>, "Florian G(dot) Pflug" <fgp(at)phlo(dot)org>
Subject: Re: Low hanging fruit in lazy-XID-assignment patch?
Date: 2007-09-08 21:19:34
Message-ID: 87veakx3bt.fsf@oxford.xeocode.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers


"Josh Berkus" <josh(at)agliodbs(dot)com> writes:

> No, that would be REPEATABLE READ. That's one of the areas where we need to
> test HOT; does RR and SERIALIZABLE still work correctly with HOT?

I'm a little confused by your question. REPEATABLE READ is an isolation level
we don't directly support in Postgres. If you set the isolation level to
REPEATABLE READ you get SERIALIZABLE which is a higher level.

HOT works fine with SERIALIZABLE, It uses the same criteria as vacuum for
determining when a tuple is dead, namely it compares against RecentGlobalXmin.

The check for whether a transaction can see any old tuples in "broken" chains
uses the serializable snapshot as a conservative proxy for the oldest snapshot
which might be in use. That will work for both serializable and read
committed.

--
Gregory Stark
EnterpriseDB http://www.enterprisedb.com

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Tom Lane 2007-09-08 21:29:05 Re: WIP patch for latestCompletedXid method of computing snapshot xmax
Previous Message Josh Berkus 2007-09-08 21:18:34 Re: WIP patch for latestCompletedXid method of computing snapshot xmax