Re: How would sorting work with millions of rows in a huge DB with PG?

From: tomas(at)tuxteam(dot)de
To: Vaibhav Kaushal <vaibhavkaushal123(at)gmail(dot)com>
Cc: pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: How would sorting work with millions of rows in a huge DB with PG?
Date: 2011-04-10 05:37:54
Message-ID: 20110410053754.GB27701@tomas
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: 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-----

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Oleg Bartunov 2011-04-10 10:18:14 Re: k-neighbourhood search in databases
Previous Message Bruce Momjian 2011-04-10 04:52:01 Re: pg_upgrade bug found!