Bruce Momjian <[EMAIL PROTECTED]> writes:
> Greg Stark wrote:
>> Actually the sort algorithm postgres uses would be much more efficient if it
>> could get access to two or three locations guaranteed to be on different
>> spindles.
> Agreed, and I was going to mention the idea of a round-robin allocation
> setup where the system cycles through a list of possible locations for
> both sort files and temporary tables.
Greg's point was that sort would want to *know* that it created three
temp files on three different devices. Throwing random effects of other
sessions into the mix wouldn't make it better.
regards, tom lane
---------------------------(end of broadcast)---------------------------
TIP 9: the planner will ignore your desire to choose an index scan if your
joining column's datatypes do not match
