Re: B-Tree support function number 3 (strxfrm() optimization)
| От | Robert Haas |
|---|---|
| Тема | Re: B-Tree support function number 3 (strxfrm() optimization) |
| Дата | |
| Msg-id | CA+TgmoZuwYYQutgAYbViyJL9si50WgGsqO++WMKDcsWo=s0QTw@mail.gmail.com обсуждение исходный текст |
| Ответ на | Re: B-Tree support function number 3 (strxfrm() optimization) (Peter Geoghegan <pg@heroku.com>) |
| Ответы |
Re: B-Tree support function number 3 (strxfrm() optimization)
|
| Список | pgsql-hackers |
On Tue, Jan 20, 2015 at 8:39 PM, Peter Geoghegan <pg@heroku.com> wrote: > On Tue, Jan 20, 2015 at 5:32 PM, Robert Haas <robertmhaas@gmail.com> wrote: >> I was assuming we were going to fix this by undoing the abbreviation >> (as in the abort case) when we spill to disk, and not bothering with >> it thereafter. > > The spill-to-disk case is at least as compelling at the internal sort > case. The overhead of comparisons is much higher for tapesort. First, we need to unbreak this. Then, we can look at optimizing it. The latter task will require performance testing. -- Robert Haas EnterpriseDB: http://www.enterprisedb.com The Enterprise PostgreSQL Company
В списке pgsql-hackers по дате отправления: