From: | "Pavan Deolasee" <pavan(dot)deolasee(at)gmail(dot)com> |
---|---|
To: | "Tom Lane" <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | "Pavan Deolasee" <pavan(dot)deolasee(at)enterprisedb(dot)com>, pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: Bug in VACUUM FULL ? |
Date: | 2007-03-10 18:33:00 |
Message-ID: | 2e78013d0703101033u543aa3fbve40a4f647a1046dc@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On 3/10/07, Pavan Deolasee <pavan(dot)deolasee(at)gmail(dot)com> wrote:
>
>
> scan_heap() would usually have collected the DEAD tuple in offsets_free
> list. How do you plan to check if the tuple is in middle on a chain which
> has
> RECENTLY_DEAD tuple before the tuple under check ? Don't we need
> to collect the TID of the DEAD tuple in the vtlinks[] as well to establish
> the backward chains ?
>
>
Now that I read your first mail more carefully, I think you are suggesting
that we move the tuple chains in pieces where each piece is terminated
when we see a DEAD tuple. In that case, we don't need any of what
I said above. Also, ISTM that HOT would work fine with this change
and we may not need to the xmin-hack I described earlier. So it makes
me comfortable. Well, at least until I take your modified code, merge
HOT-changes and rerun the crazy UPDATE/VACUUM FULL intensive
tests :)
Thanks,
Pavan
--
EnterpriseDB http://www.enterprisedb.com
From | Date | Subject | |
---|---|---|---|
Next Message | Gregory Stark | 2007-03-10 18:38:18 | Re: Bug in VACUUM FULL ? |
Previous Message | Pavan Deolasee | 2007-03-10 18:06:05 | Re: Bug in VACUUM FULL ? |