diff options
| author | Tom Lane <tgl@sss.pgh.pa.us> | 2021-08-16 16:48:25 -0400 | 
|---|---|---|
| committer | Tom Lane <tgl@sss.pgh.pa.us> | 2021-08-16 16:48:25 -0400 | 
| commit | 3aafc030a53621e91be2e7c1c72b5f3e8b103486 (patch) | |
| tree | c403c88766e55af132240aeaae7fceca57cf288a /contrib/btree_gist/sql/cash.sql | |
| parent | 069d33d0c5a021601245e44df77a0423ddd69359 (diff) | |
Reduce memory consumption for pending invalidation messages.
The existing data structures in inval.c are fairly inefficient for
the common case of a command or subtransaction that registers a small
number of cache invalidation events.  While this doesn't matter if we
commit right away, it can build up to a lot of bloat in a transaction
that contains many DDL operations.  By making a few more assumptions
about the expected use-case, we can switch to a representation using
densely-packed arrays.  Although this eliminates some data-copying,
it doesn't seem to make much difference time-wise.  But the space
consumption decreases substantially.
Patch by me; thanks to Nathan Bossart for review.
Discussion: https://postgr.es/m/2380555.1622395376@sss.pgh.pa.us
Diffstat (limited to 'contrib/btree_gist/sql/cash.sql')
0 files changed, 0 insertions, 0 deletions
