| From: | Peter Geoghegan <pg(at)heroku(dot)com> |
|---|---|
| To: | Feng Tian <ftian(at)vitessedata(dot)com> |
| Cc: | Simon Riggs <simon(at)2ndquadrant(dot)com>, Pg Hackers <pgsql-hackers(at)postgresql(dot)org>, Heikki Linnakangas <hlinnaka(at)iki(dot)fi>, Robert Haas <robertmhaas(at)gmail(dot)com> |
| Subject: | Re: Using quicksort for every external sort run |
| Date: | 2015-08-20 20:31:16 |
| Message-ID: | CAM3SWZQ=bD_y+xCnbe=AhKgKf6gJf-FKxSEQZb9YyHBEgiDKsg@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Thu, Aug 20, 2015 at 1:28 PM, Feng Tian <ftian(at)vitessedata(dot)com> wrote:
> Agree everything in principal,except one thing -- no, random IO on HDD in
> 2010s (relative to CPU/Memory/SSD), is not any faster than tape in 1970s.
> :-)
Sure. The advantage of replacement selection could be a deciding
factor in unrepresentative cases, as I mentioned, but even then it's
not going to be a dramatic difference as it would have been in the
past.
By the way, please don't top-post.
--
Peter Geoghegan
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Andrew Dunstan | 2015-08-20 20:37:45 | Re: jsonb array-style subscripting |
| Previous Message | Feng Tian | 2015-08-20 20:28:27 | Re: Using quicksort for every external sort run |