Re: Use generation context to speed up tuplesorts

From: Ronan Dunklau <ronan(dot)dunklau(at)aiven(dot)io>
To: David Rowley <dgrowleyml(at)gmail(dot)com>, pgsql-hackers(at)lists(dot)postgresql(dot)org, Tomas Vondra <tomas(dot)vondra(at)enterprisedb(dot)com>
Cc: Andres Freund <andres(at)anarazel(dot)de>, Tomas Vondra <tv(at)fuzzy(dot)cz>
Subject: Re: Use generation context to speed up tuplesorts
Date: 2021-12-16 16:03:39
Message-ID: 36444569.XM6RcZxFsP@aivenronan
Views: Raw Message | Whole Thread | Download mbox | Resend email
Lists: pgsql-hackers

Le jeudi 16 décembre 2021, 11:56:15 CET Ronan Dunklau a écrit :
> I will follow up with a benchmark of the test sorting a table with a width
> varying from 1 to 32 columns.

So please find attached another benchmark for that case.

The 3 different patchsets tested are:

- master
- fixed (David's original patch)
- adjust (Thomas growing blocks patch)

So it looks like tuning malloc for this would be very benificial for any kind
of allocation, and by doing so we reduce the problems seen with the growing
blocks patch to next to nothing, while keeping the ability to not allocate too
much memory from the get go.

I would like to try to implement some dynamic glibc malloc tuning, if that is
something we don't reject on principle from the get go.

Ronan Dunklau

Attachment Content-Type Size
bench_results.ods application/vnd.oasis.opendocument.spreadsheet 63.1 KB

In response to


Browse pgsql-hackers by date

  From Date Subject
Next Message Steinar H. Gunderson 2021-12-16 16:04:40 Re: [PATCH] Document heuristics for parameterized paths
Previous Message Andrew Dunstan 2021-12-16 16:02:53 Re: Buildfarm support for older versions