Re: [COMMITTERS] pgsql: Teach tuplesort.c about "top N" sorting, in which only the first

Поиск
Список
Период
Сортировка
От Tom Lane
Тема Re: [COMMITTERS] pgsql: Teach tuplesort.c about "top N" sorting, in which only the first
Дата
Msg-id 5382.1178303367@sss.pgh.pa.us
обсуждение исходный текст
Ответ на Re: [COMMITTERS] pgsql: Teach tuplesort.c about "top N" sorting, in which only the first  (Jim Nasby <decibel@decibel.org>)
Ответы Re: [COMMITTERS] pgsql: Teach tuplesort.c about "top N" sorting, in which only the first  ("Guillaume Smet" <guillaume.smet@gmail.com>)
Список pgsql-hackers
Jim Nasby <decibel@decibel.org> writes:
> If the method is disk it would be nice to know how much spilled to  
> disk. That would tell you if it would be worth increasing work_mem,  
> and by how much.

Well, a more radical proposal is to add a whole 'nother line to the
output, which would give us room for several bits of info.  Perhaps
like this:
  ->  Sort  (cost=840.19..865.19 rows=10000 width=244) (actual time=151.769..152.157 rows=100 loops=1)        Sort Key:
fivethous       Sort Method: top-N  Memory: 17KB        ->  Seq Scan on tenk1  (cost=0.00..458.00 rows=10000 width=244)
(actual

or
        Sort Method: disk  Memory: 1000KB  Disk: 18482KB

Not sure what other info might be useful.
        regards, tom lane


В списке pgsql-hackers по дате отправления:

Предыдущее
От: Robert Treat
Дата:
Сообщение: Re: Feature freeze progress report
Следующее
От: Dave Page
Дата:
Сообщение: Re: RETURN QUERY in PL/PgSQL?