Hi there,

quick question, given this table:

With potential sample data such as:

[
{ 1, 2 }
{ 1, 3 }
{ 2, 4 }
{ 2, 3 }
{ 1, 5 }
]

I would like to devise a query that can efficiently return all S values that contain a certain set: S, G<X,Y,Z> where G is inclusive

Example, if I were to ask for all M=2,5 it should return 1 since there exists sets where the values are (boldfaced above):

{1,2}
{1,5}

Likewise, asking for M=3,4,5 should fail, since there is no S value that contains M=3, M=4 and M=5...question makes sense?

Something like this possible with MySQL?

Thanks!

SELECT S FROM A WHERE M IN ( 2, 5 )
GROUP BY S HAVING COUNT(*) = 2

SELECT S FROM A WHERE M IN ( list of values )
GROUP BY S HAVING COUNT(*) = number_of_items_in_list

Brilliant. I hadn't thought of checking for a count in a HAVING clause.

Thanks as always!!