Re: [HACKERS] sort on huge table

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: t-ishii(at)sra(dot)co(dot)jp
Cc: pgsql-hackers(at)postgreSQL(dot)org
Subject: Re: [HACKERS] sort on huge table
Date: 1999-10-16 20:29:21
Message-ID: 9486.940105761@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Tatsuo Ishii <t-ishii(at)sra(dot)co(dot)jp> writes:
> I have done the 2GB test on current (with your fixes). This time the
> sorting query worked great! I saw lots of temp files, but the total
> disk usage was almost same as before (~10GB). So I assume this is ok.

I have now committed another round of changes that reduce the temp file
size to roughly the volume of data to be sorted. It also reduces the
number of temp files --- there will be only one per GB of sort data.
If you could try sorting a table larger than 4GB with this code, I'd be
much obliged. (It *should* work, of course, but I just want to be sure
there are no places that will have integer overflows when the logical
file size exceeds 4GB.) I'd also be interested in how the speed
compares to the old code on a large table.

Still need to look at the memory-consumption issue ... and CREATE INDEX
hasn't been taught about any of these fixes yet.

regards, tom lane

Browse pgsql-hackers by date

  From Date Subject
Next Message Bruce Momjian 1999-10-17 01:48:18 Re: [HACKERS] pg_type questions
Previous Message Peter Eisentraut 1999-10-16 19:37:25 Re: ORACLE COMMENT statement