|From:||Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>|
|To:||"Pavan Deolasee" <pavan(dot)deolasee(at)gmail(dot)com>|
|Subject:||Re: VACUUM Improvements - WIP Patch|
|Views:||Raw Message | Whole Thread | Download mbox | Resend email|
"Pavan Deolasee" <pavan(dot)deolasee(at)gmail(dot)com> writes:
> Here is a WIP patch based on the discussions here:
I do not like this patch in any way, shape, or form.
(1) It's enormously overcomplicated, and therefore fragile.
(2) It achieves speedup of VACUUM by pushing work onto subsequent
regular accesses of the page, which is exactly the wrong thing.
Worse, once you count the disk writes those accesses will induce it's
not even clear that there's any genuine savings.
(3) The fact that it doesn't work until concurrent transactions have
gone away makes it of extremely dubious value in real-world scenarios,
as already noted by Simon.
It strikes me that what you are trying to do here is compensate for
a bad decision in the HOT patch, which was to have VACUUM's first
pass prune/defrag a page even when we know we are going to have to
come back to that page later. What about trying to fix things so
that if the page contains line pointers that need to be removed,
the first pass doesn't dirty it at all, but leaves all the work
to be done at the second visit? I think that since heap_page_prune
has been refactored into a "scan" followed by an "apply", it'd be
possible to decide before the "apply" step whether this is the case
regards, tom lane
|Next Message||Tom Lane||2008-07-12 19:17:59||Re: PATCH: CITEXT 2.0 v3|
|Previous Message||Tom Lane||2008-07-12 16:48:41||Re: Vacuuming leaked temp tables (once again)|
|Next Message||Tom Lane||2008-07-12 18:27:57||Re: Relation forks & FSM rewrite patches|
|Previous Message||Tom Lane||2008-07-12 15:26:10||Re: posix advises ...|