Re: Using quicksort for every external sort run
От | Robert Haas |
---|---|
Тема | Re: Using quicksort for every external sort run |
Дата | |
Msg-id | CA+TgmoaPhB_c7+QxvsUZg6zwxODY2muBA3uDwaF-SLzf-qgWbA@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: Using quicksort for every external sort run (Peter Geoghegan <pg@heroku.com>) |
Ответы |
Re: Using quicksort for every external sort run
|
Список | pgsql-hackers |
On Wed, Jan 27, 2016 at 8:20 AM, Peter Geoghegan <pg@heroku.com> wrote: > Correct me if I'm wrong, but I think that the only outstanding issue > with all patches posted here so far is the "quicksort with spillover" > cost model. Hopefully this can be cleared up soon. As I've said, I am > very receptive to other people's suggestions about how that should > work. I feel like this could be data driven. I mean, the cost model is based mainly on the tuple width and the size of the SortTuple array. So, it should be possible to tests of both algorithms on 32, 64, 96, 128, ... byte tuples with a SortTuple array that is 256MB, 512MB, 768MB, 1GB, ... Then we can judge how closely the cost model comes to mimicking the actual behavior. -- Robert Haas EnterpriseDB: http://www.enterprisedb.com The Enterprise PostgreSQL Company
В списке pgsql-hackers по дате отправления: