Re: Sort performance cliff with small work_mem
От
Robert Haas
Тема
Re: Sort performance cliff with small work_mem
Дата
Msg-id
CA+Tgmob-_MwpkXpKAGWs8-_m4Ph=zgqL7ZnHywgCGeP0h8i-BA@mail.gmail.com
Ответ на
Sort performance cliff with small work_mem (Heikki Linnakangas)
Список
Дерево обсуждения
Sort performance cliff with small work_mem Heikki Linnakangas <hlinnaka@iki.fi>
Re: Sort performance cliff with small work_mem Robert Haas <robertmhaas@gmail.com>
Re: Sort performance cliff with small work_mem Tom Lane <tgl@sss.pgh.pa.us>
Re: Sort performance cliff with small work_mem Heikki Linnakangas <hlinnaka@iki.fi>
Re: Sort performance cliff with small work_mem Peter Geoghegan <pg@bowt.ie>
Re: Sort performance cliff with small work_mem Peter Geoghegan <pg@bowt.ie>
Re: Sort performance cliff with small work_mem Tom Lane <tgl@sss.pgh.pa.us>
Re: Sort performance cliff with small work_mem Peter Geoghegan <pg@bowt.ie>
Re: Sort performance cliff with small work_mem Peter Geoghegan <pg@bowt.ie>
Re: Sort performance cliff with small work_mem Peter Geoghegan <pg@bowt.ie>
On Wed, May 2, 2018 at 11:38 AM, Heikki Linnakangas wrote: > To fix, I propose that we change the above so that we always subtract > tapeSpace, but if there is less than e.g. 32 kB of memory left after that > (including, if it went below 0), then we bump availMem back up to 32 kB. So > we'd always reserve 32 kB to hold the tuples, even if that means that we > exceed 'work_mem' slightly. Sounds very reasonable. -- Robert Haas EnterpriseDB: http://www.enterprisedb.com The Enterprise PostgreSQL Company
В списке pgsql-hackers по дате отправления
