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-11-01 22:49:03 |
Message-ID: | 4619.941496543@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:
> RedHat Linux 6.0 (kernel 2.2.5-smp)
> Pentium III 500MHz x 2
> RAM: 512MB
> Disk: Ultra Wide SCSI 9GB x 4 + Hardware RAID (RAID 5).
OK, no problem with inadequate hardware anyway ;-). Bruce's concern
about simplistic read-ahead algorithm in Linux may apply though.
> Also, I could provide testing scripts to reproduce my tests.
Please. That would be very handy so that we can make sure we are all
comparing the same thing. I assume the scripts can be tweaked to vary
the amount of disk space used? I can't scare up more than a couple
hundred meg at the moment. (The natural state of a disk drive is
"full" ...)
> I think it depends on the disk space available. Ideally it should be
> able to choice the sort algorithm.
I was hoping to avoid that, because of the extra difficulty of testing
and maintenance. But it may be the only answer.
regards, tom lane
From | Date | Subject | |
---|---|---|---|
Next Message | Bruce Momjian | 1999-11-01 23:04:42 | Re: [HACKERS] change in name of perl? |
Previous Message | Tatsuo Ishii | 1999-11-01 22:42:50 | Re: [HACKERS] sort on huge table |