Re: sorting problem
От
Tom Lane
Тема
Re: sorting problem
Дата
Msg-id
21540.1103308172@sss.pgh.pa.us
Ответ на
Re: sorting problem (Greg Stark)
Список
Дерево обсуждения
sorting problem Jamie Deppeler <jamie@doitonce.net.au>
Re: sorting problem Michael Fuhr <mike@fuhr.org>
Re: sorting problem Chris Smith <chris@interspire.com>
Re: sorting problem Greg Stark <gsstark@mit.edu>
Re: sorting problem Bruno Wolff III <bruno@wolff.to>
Re: sorting problem Tom Lane <tgl@sss.pgh.pa.us>
Re: sorting problem Lincoln Yeoh <lyeoh@pop.jaring.my>
Re: sorting problem Greg Stark <gsstark@mit.edu>
Re: sorting problem Tom Lane <tgl@sss.pgh.pa.us>
Re: sorting problem Greg Stark <gsstark@mit.edu>
Re: sorting problem Bruno Wolff III <bruno@wolff.to>
Re: sorting problem Bruno Wolff III <bruno@wolff.to>
Re: sorting problem Tom Lane <tgl@sss.pgh.pa.us>
Re: sorting problem Peter Eisentraut <peter_e@gmx.net>
Re: sorting problem Michael Fuhr <mike@fuhr.org>
Re: sorting problem Peter Eisentraut <peter_e@gmx.net>
Greg Stark writes: > Bruno Wolff III writes: >> Using an index to do an order by is an order N operation. > No, using an index to do an order by is actually still n*log(n). You have to > traverse all the parent pages in the binary tree of the index as well. Only if you searched afresh from the root for each key, which an indexscan is not going to do. regards, tom lane
В списке pgsql-general по дате отправления
