Re: Threaded Sorting

Bingo = great :).
The I/O problem seems to be solved :).

A table space concept would be top of the histlist :).

The symlink version is not very comfortable and I think it would be a
real hack.
Also: If we had a clean table space concept it would be real advantage.
In the first place it would be enough to define a directory (alter
tablespace, changing sizes etc. could be a lot of work).

How could CREATE TABLESPACE look like?
Personally I like the Oracle Syntax.

Is it already time to work on the parser for CREATE/ALTER/DROP TABLESPACE?

Hans

Tom Lane wrote:

>Bruce Momjian <pgman(at)candle(dot)pha(dot)pa(dot)us> writes:
>
>
>>Bingo! Want to increase sorting performance, give it more I/O
>>bandwidth, and it will take 1/100th of the time to do threading.
>>
>>
>
>
>
>>Added to TODO:
>> * Allow sorting to use multiple work directories
>>
>>
>
>Yeah, I like that. Actually it should apply to all temp files not only
>sorting.
>
>A crude hack would be to allow there to be multiple pg_temp_NNN/
>subdirectories (read symlinks) in a database, and then the code would
>automatically switch among these.
>
>Probably a cleaner idea would be to somehow integrate this with
>tablespace management --- if you could mark some tablespaces as intended
>for temp stuff, the system could round-robin among those as it creates
>temp files and/or temp tables.
>
> regards, tom lane
>
>

--
*Cybertec Geschwinde u Schoenig*
Ludo-Hartmannplatz 1/14, A-1160 Vienna, Austria
Tel: +43/1/913 68 09; +43/664/233 90 75
www.postgresql.at <http://www.postgresql.at>, cluster.postgresql.at
<http://cluster.postgresql.at>, www.cybertec.at
<http://www.cybertec.at>, kernel.cybertec.at <http://kernel.cybertec.at>