From: | The Hermit Hacker <scrappy(at)hub(dot)org> |
---|---|
To: | Oleg Bartunov <oleg(at)sai(dot)msu(dot)su> |
Cc: | pgsql-hackers(at)postgreSQL(dot)org, tgl(at)sss(dot)pgh(dot)pa(dot)us, vadim(at)krs(dot)ru |
Subject: | Re: [HACKERS] row reuse while UPDATE and vacuum analyze problem |
Date: | 1999-07-28 12:00:21 |
Message-ID: | Pine.BSF.4.05.9907280854190.78452-100000@thelab.hub.org |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Wed, 28 Jul 1999, Oleg Bartunov wrote:
> How update performance could be increased if:
> 1. 'vacuum analyze' will analyze index file
> 2. reuse row instead of inserting
Just to clarify, 'reuse row' won't replace inserting (to the best of my
knowledge), only reduce space wastage between vacuum's. Especially, again
TTBOMK, with MVCC, where each "instance" of a row is serialized.
Actually, there is a tought...if I understand the concept of MVCC, how is
reusing a row going to work? My understanding is that I can "physically"
have to copies of a row in a table, one newer then the other. So, if
someone is running a SELECT while I'm doing an UPDATE, their SELECT will
take the older version of hte row (the row at the time their SELECT
started)...depending on how busy that table is, there will have to be some
sort of mechanism for determining how 'stale' a row is, no?
ie. on a *very* large table, with multiple SELECT/UPDATEs happening?
Marc G. Fournier ICQ#7615664 IRC Nick: Scrappy
Systems Administrator @ hub.org
primary: scrappy(at)hub(dot)org secondary: scrappy(at){freebsd|postgresql}.org
From | Date | Subject | |
---|---|---|---|
Next Message | The Hermit Hacker | 1999-07-28 12:04:54 | Re: [HACKERS] Arbitrary tuple size |
Previous Message | Oleg Bartunov | 1999-07-28 10:39:21 | row reuse while UPDATE and vacuum analyze problem |