Re: vacuum, performance, and MVCC

From: Bruce Momjian <bruce(at)momjian(dot)us>
To: Jan Wieck <JanWieck(at)Yahoo(dot)com>
Cc: Hannu Krosing <hannu(at)skype(dot)net>, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Csaba Nagy <nagy(at)ecircle-ag(dot)com>, Mark Woodward <pgsql(at)mohawksoft(dot)com>, "Jonah H(dot) Harris" <jonah(dot)harris(at)gmail(dot)com>, Christopher Browne <cbbrowne(at)acm(dot)org>, postgres hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: vacuum, performance, and MVCC
Date: 2006-06-25 21:18:10
Message-ID: 200606252118.k5PLIAj19750@momjian.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Jan Wieck wrote:
> >> An update that results in all the same values of every indexed column of
> >> a known deleted invisible tuple. This reused tuple can by definition not
> >> be the one currently updated. So unless it is a table without a primary
> >> key, this assumes that at least 3 versions of the same row exist within
> >> the same block. How likely is that to happen?
> >
> > Good question. You take the current tuple, and make another one on the
> > same page. Later, an update can reuse the original tuple if it is no
> > longer visible to anyone (by changing the item id), so you only need two
> > tuples, not three. My hope is that a repeated update would eventually
> > move to a page that enough free space for two (or more) versions.
> >
> > Does that help explain it?
> >
>
> That's exactly what I meant. You need space for 3 or more tuple versions
> within one page and the luck that one of them is invisible at the time
> of the update. I don't know how likely or unlikely this is in reality,
> but it doesn't sound very promising to me so far.

Why three? I explained using only two heap tuples:

[item1]...[tuple1]

becomes on UPDATE:
---------->
[item1]...[tuple1][tuple2]
----->

on another UPDATE, if tuple1 is no longer visible:

------------------>
[item1]...[tuple1][tuple2]
<------

> Another problem with this is that even if you find such row, it doesn't
> spare you the index traversal. The dead row whos item id you're reusing
> might have resulted from an insert that aborted or crashed before it
> finished creating all index entries. Or some of its index entries might
> already be flagged known dead, and you better reset those flags.

You can only reuse heap rows that were created and expired by committed
transactions. In fact, you can only UPDATE a row that was created by a
committed transaction. You cannot _reuse_ any row, but only a row that
is being UPDATEd. Also, it cannot be known dead because it are are in
the process of updating it.

I am thinking my idea was not fully understood. Hopefully this email
helps.

--
Bruce Momjian bruce(at)momjian(dot)us
EnterpriseDB http://www.enterprisedb.com

+ If your life is a hard drive, Christ can be your backup. +

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Bruce Momjian 2006-06-25 21:19:34 Re: vacuum, performance, and MVCC
Previous Message Hannu Krosing 2006-06-25 19:51:28 Re: vacuum, performance, and MVCC