Re: Parallel tuplesort (for parallel B-Tree index creation)
| От | Peter Geoghegan |
|---|---|
| Тема | Re: Parallel tuplesort (for parallel B-Tree index creation) |
| Дата | |
| Msg-id | CAM3SWZSCGz-nWEmEZTPVu-0SYdSRQwVLXo=bowtVgoP=CcY3Vg@mail.gmail.com обсуждение исходный текст |
| Ответ на | Re: Parallel tuplesort (for parallel B-Tree index creation) (Peter Geoghegan <pg@heroku.com>) |
| Ответы |
Re: Parallel tuplesort (for parallel B-Tree index creation)
|
| Список | pgsql-hackers |
On Tue, Sep 6, 2016 at 12:39 PM, Peter Geoghegan <pg@heroku.com> wrote: > On Tue, Sep 6, 2016 at 12:08 AM, Heikki Linnakangas <hlinnaka@iki.fi> wrote: >>> I attach a patch that changes how we maintain the heap invariant >>> during tuplesort merging. > >> Nice! > > Thanks! BTW, the way that k-way merging is made more efficient by this approach makes the case for replacement selection even weaker than it was just before we almost killed it. I hate to say it, but I have to wonder if we shouldn't get rid of the new-to-9.6 replacement_sort_tuples because of this, and completely kill replacement selection. I'm not going to go on about it, but that seems sensible to me. -- Peter Geoghegan
В списке pgsql-hackers по дате отправления: