Tom Lane wrote:
>
>Btree index build is primarily a sort, so cannot have better than
>O(n*log(n)) performance for random data. Not sure why you'd expect
>linearity.
>
>Increasing SORT_MEM would help the constant factor, however...
>
What is the most amount of SORT_MEM it makes sense to allocate? Pretend
the ONLY thing I care about is BTREE index creation time. (2 gigs of
RAM on my DB machine.) Disk IO is not a bottleneck.
-Pete
