in reply to Comparing strings (exact matches) in LARGE numbers FAST

Given that your lines are already unique, this is the shell-way to find the intersection of 2 uniq files:
$ sort file1.txt file2.txt | uniq -d > matches.txt

This approach would work on very large files efficiently.

Replies are listed 'Best First'.
Re^2: Comparing strings (exact matches) in LARGE numbers FAST
by perlSD (Novice) on Aug 29, 2008 at 20:17 UTC
    That is very true, Unix-like utilities are designed to work smartly with very large files...Will try.
    Thanks!!!