| From: | Greg Sabino Mullane <htamfids(at)gmail(dot)com> |
|---|---|
| To: | Vladimir Churyukin <vladimir(at)churyukin(dot)com> |
| Cc: | Konstantin Knizhnik <knizhnik(at)garret(dot)ru>, pgsql-hackers(at)lists(dot)postgresql(dot)org |
| Subject: | Re: Bypassing shared_buffers |
| Date: | 2023-06-17 22:46:53 |
| Message-ID: | CAKAnmmK1sKJs=WqGKby3dRkvnS_3hgZk6_G_fJjtWSFaCYp05g@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Thu, Jun 15, 2023 at 4:16 AM Vladimir Churyukin <vladimir(at)churyukin(dot)com>
wrote:
> We're trying to see what is the worst performance in terms of I/O, i.e.
>> when the database just started up or the data/indexes being queried are not
>> cached at all.
>
>
You could create new tables that are copies of the existing ones (CREATE
TABLE foo as SELECT * FROM ...), create new indexes, and run a query on
those. Use schemas and search_path to keep the queries the same. No restart
needed! (just potentially lots of I/O, time, and disk space :) Don't forget
to do explain (analyze, buffers) to double check things.
| From | Date | Subject | |
|---|---|---|---|
| Next Message | James Cloos | 2023-06-17 23:10:23 | deb’s pg_upgradecluster(1) vs streaming replication |
| Previous Message | Tomas Vondra | 2023-06-17 19:57:33 | Re: [PATCH] ltree hash functions |