News for hackers. Stuff that matters.
Re:Ask HN: Sorting massive text files? by keefe on Saturday August 14, 2010 @06:46PM (#1604190)
an in-memory set won't work. indexes don't have to be in memory all the time to provide log N lookup, I mean just think about how b-trees work.

...and this is a problem most databases have addressed.

Re:Ask HN: Sorting massive text files? by pvg on Sunday August 15, 2010 @04:35AM (#1604815)
It might well work, it depends a great deal on the data. In any event, I was talking about in-memory hashing, the responder's assumption that I was was correct.