sql set theory question

[garthish]

ok, this is probably something i would have figured out pretty quickly back in computer science school. but that was a long time ago and work has made me stupid.
here's the problem.

i have a set of tuples - {code,token}

every code points to a set of tokens.
some of the codes point to the same tokens.

the object is to find the sets of codes that share sets of tokens, where the cardinality of the set of shared tokes is > 1

i have a truly ugly recursive brute force solution written in c# but it just seems like there ought to be an elegant simple bit of sql which will yield the same results. sadly, it has yet to occur to me. pretty sure this is going to take somebody several seconds to solve.
thanks,
garth

[rmiao]

Take look at 'Recursive Queries Using Common Table Expressions' in sql server books online.

[mikr0s]

could it be that simple?
select code
from tuples
group by code
having count(distinct token) > 1

--HTH--