diff options
| author | Bruce Momjian <bruce@momjian.us> | 2023-09-26 19:44:22 -0400 |
|---|---|---|
| committer | Bruce Momjian <bruce@momjian.us> | 2023-09-26 19:44:22 -0400 |
| commit | 5f567b3c35c10668f62839a4a6d111b2d62e770a (patch) | |
| tree | 5bfa09c10ba953555babb6e890390a18594fbe71 /doc/src | |
| parent | eec2190b8c9b353c74aa03124d5664614c475305 (diff) | |
| download | postgresql-5f567b3c35c10668f62839a4a6d111b2d62e770a.tar.gz postgresql-5f567b3c35c10668f62839a4a6d111b2d62e770a.zip | |
doc: clarify the effect of concurrent work_mem allocations
Reported-by: Sami Imseih
Discussion: https://postgr.es/m/66590882-F48C-4A25-83E3-73792CF8C51F@amazon.com
Backpatch-through: 11
Diffstat (limited to 'doc/src')
| -rw-r--r-- | doc/src/sgml/config.sgml | 9 |
1 files changed, 5 insertions, 4 deletions
diff --git a/doc/src/sgml/config.sgml b/doc/src/sgml/config.sgml index 90ba406e442..38684af5b18 100644 --- a/doc/src/sgml/config.sgml +++ b/doc/src/sgml/config.sgml @@ -1834,9 +1834,10 @@ include_dir 'conf.d' (such as a sort or hash table) before writing to temporary disk files. If this value is specified without units, it is taken as kilobytes. The default value is four megabytes (<literal>4MB</literal>). - Note that for a complex query, several sort or hash operations might be - running in parallel; each operation will generally be allowed - to use as much memory as this value specifies before it starts + Note that a complex query might perform several sort and hash + operations at the same time, with each operation generally being + allowed to use as much memory as this value specifies before + it starts to write data into temporary files. Also, several running sessions could be doing such operations concurrently. Therefore, the total memory used could be many times the value @@ -1850,7 +1851,7 @@ include_dir 'conf.d' <para> Hash-based operations are generally more sensitive to memory availability than equivalent sort-based operations. The - memory available for hash tables is computed by multiplying + memory limit for a hash table is computed by multiplying <varname>work_mem</varname> by <varname>hash_mem_multiplier</varname>. This makes it possible for hash-based operations to use an amount of memory |