Re: How would sorting work with millions of rows in a huge DB with PG?
| От | tomas@tuxteam.de |
|---|---|
| Тема | Re: How would sorting work with millions of rows in a huge DB with PG? |
| Дата | |
| Msg-id | 20110410053754.GB27701@tomas обсуждение исходный текст |
| Ответ на | How would sorting work with millions of rows in a huge DB with PG? (Vaibhav Kaushal <vaibhavkaushal123@gmail.com>) |
| Ответы |
Re: How would sorting work with millions of rows in a huge
DB with PG?
|
| Список | pgsql-hackers |
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Sun, Apr 10, 2011 at 05:20:02AM +0530, Vaibhav Kaushal wrote: > Hello all, > > I was going through some papers related to sorting and since I am > studying PG code side by side, I wondered how sorting would be done on a > DB with millions of rows on disk with GBs of data. Since holding > everything in memory would not be the possible solution, how do we > actually sort the results in such conditions. Look for "external sort" and "external merge" Regards - -- tomás -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (GNU/Linux) iD8DBQFNoUIyBcgs9XrR2kYRAua/AJ4sIw54Mq6EgCsJzGqqmYELLPnSOwCeN0+S f19mq0vePoCC9rAWLtWpUUE= =8XVk -----END PGP SIGNATURE-----
В списке pgsql-hackers по дате отправления: