I usually try with and without the distinct keywork in cases such as
this, and choose the fastest one.

So basically, there is no hack that can determine if two sets overlap,
without actually determining the intersect, in SQL. That's fine if that
is the answer.

Thanks all,

Dean

I usually try with and without the distinct keywork in cases such as
this, and choose the fastest one.

So basically, there is no hack that can determine if two sets overlap,
without actually determining the intersect, in SQL. That's fine if that
is the answer.

Thanks all,

Dean

I usually try with and without the distinct keywork in cases such as
this, and choose the fastest one.

So basically, there is no hack that can determine if two sets overlap,
without actually determining the intersect, in SQL. That's fine if that
is the answer.

Thanks all,

Dean