Re:Ask HN: Sorting massive text files?
by naz on Saturday August 14, 2010 @12:01PM
(#1603455)
would be faster than all that piping
[ Parent
| on HN ]
Re:Ask HN: Sorting massive text files?
by secretasiandan on Saturday August 14, 2010 @12:20PM
(#1603514)
I've never used it but there's a -S flag for sort that allows you to specify buffer size. So maybe look into increasing that as large as you can.
-S is quite useful. For bigger sorting tasks, I usually use -S50% to speed up the speed of sorting. (sort's default memory size must be about 1MB).
It may also help to use compression with the temporary files (something like "--compress-program lzop"), but I've never tried that.
Compared to the IO costs, the computational difference must be inconsequential.
Right, but sort is apparently clever enough to do a disk-backed mergesort on a file (according to timr's comment), but it doesn't get a chance to recognize that you're sorting a file if you just pipe in the data.
Why did you get modded up? You're wrong. Sort will write temporary files to /tmp if you exceed its in-memory sort threshold.
Did you really think sort(1) just bails if you pipe it more data than can be contained in memory?
You're correct. Perhaps the up-voters were thinking it must just be better to report the piping. Which it is, but that doesn't make the comment valid.
Er, you're right. I don't know what I was thinking.