Re: Sorting performance vs. MySQL

From: Yang Zhang <yanghatespam(at)gmail(dot)com>
To: Pavel Stehule <pavel(dot)stehule(at)gmail(dot)com>
Cc: pgsql-general(at)postgresql(dot)org
Subject: Re: Sorting performance vs. MySQL
Date: 2010-02-22 18:35:23
Message-ID: 9066fa251002221035s38a1a72j5a73d301553a72b@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

On Mon, Feb 22, 2010 at 1:13 PM, Pavel Stehule <pavel(dot)stehule(at)gmail(dot)com> wrote:
> hello
>
> the speed depends on setting of working_memory. Try to increase a working_memory
>
> set working_memory to '10MB';

It's already at

tpcc=# show work_mem;
work_mem
----------
20000kB
(1 row)

I also wouldn't have imagined an external merge-sort as being very
memory-intensive--wouldn't it only enough buffer space to read 2x and
write 1x in big-enough chunks for mostly-sequential access?
--
Yang Zhang
http://www.mit.edu/~y_z/

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message flashbangpop 2010-02-22 18:36:18 Re: Complex SELECT Statement help needed
Previous Message Richard Broersma 2010-02-22 18:30:00 Re: Sorting performance vs. MySQL