Re: Memory usage during sorting

Jeff Janes <jeff.janes@gmail.com>

From: Jeff Janes <jeff.janes@gmail.com>

To: Peter Geoghegan <peter@2ndquadrant.com>

Cc: pgsql-hackers <pgsql-hackers@postgresql.org>

Date: 2012-02-04T18:12:16Z

Lists: pgsql-hackers

Commits

Same data as JSON: GET /api/v1/messages/:b64id/commits the thread's linked commits as JSON, with link sources. API reference →

Improve performance of our private version of qsort. Per recent testing,
- a3f0b3d68f9a 8.2.0 cited
Further performance improvements in sorting: reduce number of comparisons
- cf627ab41ab9 7.1.1 cited

On Sat, Feb 4, 2012 at 10:06 AM, Jeff Janes <jeff.janes@gmail.com> wrote:

> Attached is a completely uncommitable proof of concept/work in
> progress patch to get around the limitation.  It shows a 2 fold
> improvement when indexing an integer column on a 50,000,000 row
> randomly ordered table.

Oops, forgot to say that is with
set maintenance_work_mem=4194304;