This answer has not been rated.

This answer has not been rated.

This answer has not been rated.

Succinct and accurate and a great help - thanks!

This answer has not been rated.

This answer has not been rated.

This answer has not been rated.

When I posted my question, I had no idea of how difficult it was.
Mathtalk didn't just give the correct answer, but also provided
patience, comprehension, enthusiasm and effort far beyond I expected.
Thanks to that generosity I learned a lot from the answer and
comments.

Many thanks! Really!

Octava

This answer has not been rated.

This answer has not been rated.

Thanks for your help!

I tried to rate this and it failed...  Try #2 - GREAT, I'm traveling
this week and don't have good opportunity to test it, but looks great
on the surface!  I'll post the follow up (to pay the additional $50)
and to add a character delimited source file!  you are the GOOGLE
GOD!!!  :)

I didn't realize the $100.00 tip limit when we "negotiated".  ;)

Thanks,
Charlie

Thanks for the well structured answer. It should allow me to get my task finished.

Thanks for the help, I'm going to take your answer and review it
thoroughly. It will be very helpful!

This answer has not been rated.

Thank you for all your exceptional, detailed work. You have
practically written my justification for me. If I can't get my rating
changed with these arguments, it wasn't meant to be. Job well done!

This answer has not been rated.

That's it!  Thank you.

This answer has not been rated.

Thanks for the speed. Your answer came just as UPS drove up. Bob

That's really helpful and fast. I learn a lot .

I now have all the information I need to start my project. Question
answered quickly and thoroughly. Thanks very much!

I got exactly what I wanted with more info than I wished.
And I like the essay mathalk wrote for me. I still keep it in my mind,
it's extremely useful. mathalk definitely has an experienc and is
willing to walk the extra mile... I appreciate it a lot.

Excellent work and very thorough, it helped me understand and further
my knowledge in this area. Thank you very much

This answer has not been rated.

Excellent work.  Thank you.

5 stars.  What else is there to say?

This answer has not been rated.

Excellent answer. Clear and concise. I really learnt a lot from
mathtalk.The answers given saved me a lot of time.

This answer has not been rated.

Perfect.  Those links confirmed a lot of what I thought which was really helpful.

This answer has not been rated.

It works!  Microsoft made it fun for us with a difference between
Nodes, Elements, and Attributes, but you got me through it.  Thanks.

Great Answer, totally works for me. I was able to reach solution
myself but yours was much simpler than mine.
Here's mine:
SELECT DISTINCT ID INTO S FROM myTable
CREATE UNIQUE CLUSTERED INDEX S_S ON S(id)
SELECT DISTINCT content INTO C FROM myTable
CREATE UNIQUE CLUSTERED INDEX C_C ON C(content)

SELECT S2.id AS SuperSet, S1.id AS Subset
FROM S S1 CROSS JOIN S S2 CROSS JOIN C 
LEFT OUTER JOIN myTABLE A
ON S1.id = A.id AND C.content = A.content
LEFT OUTER JOIN mytable B
ON S2.id = B.id AND C.content = B.content
WHERE S1.id <> S2.id
GROUP BY S1.id, S2.id
HAVING COUNT(A.content) = COUNT(A.content+B.content)
AND COUNT(A.id) < COUNT(B.id)

Researcher provided excellent resources in a fast and professional manner!
Thanks!

This answer has not been rated.

This was a VERY VERY big help. Thank you for your prompt response. I
will definitely consider using Answers.Google.com any time I have any
problem or question I need answered.

I haven't had a chance to try this out yet but thank you for all your
help & all the information.

Your answer is simple and elegant.  Thank you!

Excellent answer! That helps a lot. Thank you very much.

A top notch answer - thanks!

A perfectly comprehensive and professional response to an
exceptionally difficult question. The $100 tip on a $53 question was
worth every penny. Thank you.