SQL查询以查找多个条件的匹配项

Question

If I had a PERMISSIONS table that looked like this:

PERSON         PERMISSION
------         ----------
Bob            red
John           red
John           blue
Mary           red
Mary           blue
Mary           yellow

and a THINGS table that looks like this:

THING          PERMISSION
-----          ----------
apple          red
eggplant       red
eggplant       blue

I'm trying to come up with a pure SQL query that would let me find out what PERSON s have access to what THING s. Basically, I want a query that would look something like:

SELECT person
  FROM ... vague handwaving here ...
 WHERE thing = 'eggplant'

and have it return "John" and "Mary". The key point being the number of permissions necessary for access to the thing is arbitrary.

I feel like this should be obvious, but I just can't come up with an elegant solution. Oracle compatible solutions preferred.

Edit:

Solutions from Kosta and JBrooks work well. Below is a modified version of Kosta's solution that only hits the indexes twice, as opposed to 3x for Kosta's and 4x for JBrooks's (though I agree with JBrooks that this is probably unnecessary optimization).

SELECT p.person, num_permission, COUNT(p.person)
FROM permissions p
INNER JOIN (
    SELECT permission,
           COUNT(1) OVER (PARTITION BY thing) AS num_permission
      FROM things
     WHERE thing = 'eggplant'
  ) t ON t.permission = p.permission 
GROUP BY p.person, num_permission
HAVING COUNT(p.person) = num_permission

Answer 1

Ok, I get why people might use the Count() to match on and that could work, but I think that you will get into trouble doing this when things get a little more complicated (and they always get a little more complicated.)

If I say this problem in English it is:

1. Select the PEOPLE that have permission on that THING.
2. and there doesn't exist a PERMISSION required for that THING that the PERSON doesn't have.

So that SQL would be:

SELECT DISTINCT P.PERSON, T.THING
FROM PERMISSIONS P
INNER JOIN THINGS T
ON P.PERMISSION = T.PERMISSION
WHERE NOT EXISTS
    (SELECT 1
    FROM THINGS TSUB
    WHERE TSUB.THING = T.THING
    AND TSUB.PERMISSION NOT IN
        (SELECT PSUB.PERMISSION
        FROM PERMISSIONS PSUB
        WHERE PSUB.PERSON = P.PERSON))
ORDER BY P.PERSON, T.THING

I'm a SQL Server guy now so the syntax might be a little off, but you get the idea.

Performance: Someone is going to say that this doesn't look like the most efficient SQL, so let me defend myself now. Permission and user tables are usually on the smaller side compared to the rest of a system and with DBMS today you would be hard pressed to load enough data in these tables to make this statement run longer than a tenth of a second - especially after indexes were in use. So in the past I would have agree about the performance - today I never worry about the performance unless it jumps out at me. So much less maintenance when you approach it this way.

Answer 2

Use:

  SELECT p.person
    FROM PERMISSIONS p
    JOIN THINGS t ON t.permission = p.permission
   WHERE t.permission IN ('red', 'blue')
GROUP BY p.person
  HAVING COUNT(DISTINCT t.permission) = 2

The WHERE clause ensures that only values red and blue are included. The COUNT DISTINCT ensures that duplicates (two blue's) are not allowed, as that would be a false positive.

Answer 3

select person
from permissions 
where permission in (select permission from things where thing='eggplant')
group by person
having count(person) = (select count(permission)  from things where thing='eggplant')

Answer 4

select distinct person
from permissions p
join things      t on t.permission = p.permission
                  and t.thing      = 'eggplant'

ought to do it.