From: | David Rowley <dgrowleyml(at)gmail(dot)com> |
---|---|
To: | Christoph Berg <myon(at)debian(dot)org> |
Cc: | Tatsuo Ishii <ishii(at)postgresql(dot)org>, pgsql-hackers(at)lists(dot)postgresql(dot)org |
Subject: | Re: pgsql: Add memory/disk usage for Window aggregate nodes in EXPLAIN. |
Date: | 2025-03-31 20:11:13 |
Message-ID: | CAApHDvoZ4TeT2bSEaN+Nx94R0neBr1mmyDBx0Z5ZQXVUunu7JQ@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-committers pgsql-hackers |
On Tue, 1 Apr 2025 at 04:40, Christoph Berg <myon(at)debian(dot)org> wrote:
> - Storage: Disk Maximum Storage: NkB
> + Storage: Memory Maximum Storage: NkB
> -> Function Scan on generate_series a (actual time=N.N..N.N rows=N.N loops=N)
We'll probably just need to bump that 2000 row count to something a
bit more for 32-bit.
Any chance you could share the output of:
explain (analyze,buffers off,costs off) select sum(n) over() from
generate_series(1,2000) a(n);
Could you maybe also do a binary search for the number of rows where
it goes to disk by adjusting the 2000 up in some increments until the
Storage method is disk? (Not that I think we should set it to the
minimum, but it would be good to not set it too much higher than we
need to)
David
From | Date | Subject | |
---|---|---|---|
Next Message | Christoph Berg | 2025-03-31 20:40:31 | Re: pgsql: Add memory/disk usage for Window aggregate nodes in EXPLAIN. |
Previous Message | Todd Cook | 2025-03-31 18:58:32 | Re: pgsql: Inline CRC computation for small fixed-length input on x86 |
From | Date | Subject | |
---|---|---|---|
Next Message | Jianghua Yang | 2025-03-31 20:28:13 | [PATCH] Fix potential overflow in binary search mid calculation |
Previous Message | Melanie Plageman | 2025-03-31 19:45:09 | Re: Using read stream in autoprewarm |