|From:||Michael Paquier <michael(at)paquier(dot)xyz>|
|To:||Phil Florent <philflorent(at)hotmail(dot)com>|
|Cc:||"Yotsunaga, Naoki" <yotsunaga(dot)naoki(at)jp(dot)fujitsu(dot)com>, Tomas Vondra <tomas(dot)vondra(at)2ndquadrant(dot)com>, "pgsql-hackers(at)lists(dot)postgresql(dot)org" <pgsql-hackers(at)lists(dot)postgresql(dot)org>|
|Subject:||Re: [Proposal] Add accumulated statistics for wait event|
|Views:||Raw Message | Whole Thread | Download mbox | Resend email|
On Thu, Oct 04, 2018 at 09:32:37AM +0000, Phil Florent wrote:
> I am a DB beginner, so please tell me. It says that you can find
> events that are bottlenecks in sampling, but as you saw above, you can
> not find events shorter than the sampling interval, right?
Yes, which is why it would be as simple as making the interval shorter,
still not too short so as it bloats the amount of information fetched
which needs to be stored and afterwards (perhaps) treated for analysis.
This gets rather close to signal processing. A simple image is for
example, assuming that event A happens 100 times in an interval of 1s,
and event B only once in the same interval of 1s, then if the snapshot
interval is only 1s, then in the worst case A would be treated an equal
of B, which would be wrong.
|Next Message||Michael Paquier||2018-10-04 11:00:51||Re: [HACKERS] Optional message to user when terminating/cancelling backend|
|Previous Message||Konstantin Knizhnik||2018-10-04 09:53:45||Re: libpq compression|