From: | Amit Kapila <amit(dot)kapila16(at)gmail(dot)com> |
---|---|
To: | Abhijit Menon-Sen <ams(at)2ndquadrant(dot)com> |
Cc: | pgsql-hackers <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: a fast bloat measurement tool (was Re: Measuring relation free space) |
Date: | 2014-09-27 05:51:11 |
Message-ID: | CAA4eK1LN9ZwUTDpi1HTjBxXNJqXO0ajWq2NqwQ0kC=w=eAi7fw@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Wed, Sep 24, 2014 at 2:26 PM, Abhijit Menon-Sen <ams(at)2ndquadrant(dot)com>
wrote:
>
> Hi Amit.
>
> Thanks for your comments, and I'm sorry it's taken me so long to
> respond.
No issues.
> At 2014-08-03 11:18:57 +0530, amit(dot)kapila16(at)gmail(dot)com wrote:
> > 7.
> > HeapTupleSatisfiesVacuumNoHint()
> > a. Why can't we use HeapTupleSatisfiesVisibility() with dirty snapshot
> > as we use for pgstattuple?
>
> Heavier locking. I tried to make do with the existing HTS* functions,
> but fastbloat was noticeably faster in tests with the current setup.
I am not sure for the purpose of this functionality, why we need to
use a different HTS (HeapTupleSatisfiesVacuum) routine as compare
to pgstat_heap(). Unless you have some specific purpose to achieve,
I think it is better to use HeapTupleSatisfiesVisibility().
> Maybe I'll call it not_too_slow_bloat().
How about pgfaststattuple() or pgquickstattuple() or pgfuzzystattuple()?
With Regards,
Amit Kapila.
EnterpriseDB: http://www.enterprisedb.com
From | Date | Subject | |
---|---|---|---|
Next Message | Amit Kapila | 2014-09-27 06:34:28 | Re: Stating the significance of Lehman & Yao in the nbtree README |
Previous Message | Andrew Gierth | 2014-09-27 05:37:38 | Re: Final Patch for GROUPING SETS |