Data structure for matching attributes?

I need a data structure and data storage solution that is optimal for the following scenario:

Storing: >20M sets of attributes. Each set is of variable length. None are empty.
Matching: An inputted set with all the other stored sets. Comparing and contrasting attributes. Returning the most favorable matched sets.

I don't know where to start.

Start there:

http://www.ibm.com/
http://www.oracle.com/
http://www.sap.com/

[C]
const int NIGGERS =1000;
const int BEARD_BODY =1000;
const int INCOME_LEVEL=20;

bool(*comp)(Possible_Boyfriend,Possible_Boyfriend)=
//Your function to compare boys.

typedef TreeSet<Possible_Boyfriend,bool(*)(Possible_Boyfriend,Possible_Boyfriend)>(comp)[NIGGERS][BEAR_BODY][INCOME_LEVEL] lovePot;

[/C]

Enjoy! please not sepples a sjhit....,,  ..

>>2
That was ENTERPRISE quality!

>>4
>.<
Oh My G why des this place codetags doesn't work!?!!!♥?
Person me*=MyRoom.getMe();
me->SetFurious("very");

Roaaar, what tha fuck, who designed this shit that donest't even recognize code tags, seriosly wtf men.
me->goAway("the bar");

System.out.cout<<Place.parsePlace(me.where()).toString();

Keep the attributes in a bloom filter per set and then just calculate Hamming distances between the target bit vector and that of each of the sets. Works acceptably if you have a lot of attributes per set but not that many sets.
If you do have a lot of sets and they're distributed fairly normally, it may be possible to enumerate all bit vectors within Hamming distance x (where x is maybe 1 or 2) of the target vector and locate them more efficiently, possibly with a fallback to the other algorithm if you have an empty result set.

The real answer is to use an ENTERPRISE TURKEY SOLUTION and make it someone else's problem. That's only feasible if someone else is paying and you have no interest in knowing how shit works, though.

Read SICP.

Assuming there's a partial ordering with respect to fitness, have some O(n):


best = NULL;
while(t=set->next)
    best = better(t, best) ? t : best;

>>8
Genius.