From: | Michael Richards <miker(at)scifair(dot)acadiau(dot)ca> |
---|---|
To: | pgsql-hackers(at)postgresql(dot)org |
Subject: | sorting big tables :( |
Date: | 1998-05-15 23:09:31 |
Message-ID: | Pine.BSF.3.96.980515200206.10283B-100000@scifair.acadiau.ca |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
I think soon people are going to start calling me Mr. Big...Tables...
I have a big table. 40M rows.
On the disk, it's size is:
2,090,369,024 bytes. So 2 gigs. On a 9 gig drive I can't sort this table.
How should one decide based on table size how much room is needed?
Also, this simple table consisting of only 2 int4 values is the exact size
of an equally sized table consisting of only one int2. There seems to be
too much overhead here. I realise there are extra things that have to be
saved, but I am not getting the size/performance I had hoped for... I am
starting to think this segment of the database would be better implemented
without a dbms because it is not expected to change at all...
-Mike
From | Date | Subject | |
---|---|---|---|
Next Message | Bruce Momjian | 1998-05-16 00:00:29 | Re: [HACKERS] sorting big tables :( |
Previous Message | ocie | 1998-05-15 22:50:45 | Re: [HACKERS] mmap vs read/write |