| From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
|---|---|
| To: | Andres Freund <andres(at)anarazel(dot)de> |
| Cc: | Peter Geoghegan <pg(at)bowt(dot)ie>, PostgreSQL Hackers <pgsql-hackers(at)lists(dot)postgresql(dot)org> |
| Subject: | Re: Avoiding unnecessary clog lookups while freezing |
| Date: | 2022-12-29 17:25:03 |
| Message-ID: | 577388.1672334703@sss.pgh.pa.us |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Andres Freund <andres(at)anarazel(dot)de> writes:
> Somewhat of a tangent: I've previously wondered if we should have a small
> hash-table based clog cache. The current one-element cache doesn't suffice in
> a lot of scenarios, but it wouldn't take a huge cache to end up filtering most
> clog accesses.
I've wondered about that too. The one-element cache was a good hack
in its day, but it looks a bit under-engineered by our current
standards. (Also, maybe it'd be plausible to have a one-element
cache in front of a small hash?)
regards, tom lane
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Peter Geoghegan | 2022-12-29 17:43:39 | Re: Avoiding unnecessary clog lookups while freezing |
| Previous Message | Matthias van de Meent | 2022-12-29 17:23:34 | Re: split TOAST support out of postgres.h |