I have no idea how efficient data bases are wrt set covering, but if you want to try within Perl, there is a CPAN module using the 'greedy algorithm' (which does a pretty good approximation of the optimal set cover).
In reply to Re: Contemplating some set comparison tasks
by hexcoder
in thread Contemplating some set comparison tasks
by dwhite20899
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |