views:

794

answers:

2

Hello, everyone:

How do you make an SQL statement that returns results modified by a subquery, or a join - or something else, that deals with information you're trying to return?

For example:

CREATE TABLE bowlers (
bowling_id int4 not null primary key auto_increment,
name text,
team text
);

Someone might incorrectly be on more than one team:

INSERT INTO `bowlers` (`name`, `team`) VALUES
('homer', 'pin pals'),
('moe', 'pin pals'),
('carl', 'pin pals'),
('lenny', 'pin pals'),
('homer', 'The homer team'),
('bart', 'The homer team'),
('maggie', 'The homer team'),
('lisa', 'The homer team'),
('marge', 'The homer team'),
('that weird french guy', 'The homer team');

So homer cannot decide on his team, so he's on both. Do'h!

I want to know everyone who is on, the homer team who is not also on the pin pals team. The best I can do is this:

SELECT a.name, a.team 
    FROM bowlers a where a.team = 'The homer team' 
    AND a.name 
    NOT IN (SELECT b.name FROM bowlers b WHERE b.team = 'pin pals');

Resulting in:

+-----------------------+----------------+
| name                  | team           |
+-----------------------+----------------+
| bart                  | The homer team | 
| maggie                | The homer team | 
| lisa                  | The homer team | 
| marge                 | The homer team | 
| that weird french guy | The homer team | 
+-----------------------+----------------+
5 rows in set (0.00 sec)

Which, you know, brilliant!

The performance will suffer, as the subquery is going to be run for each result of the query, which is B to the A to the D. Great for a few rows, Pretty bad for the hundreds of thousands of rows.

What is a better way? I am mostly thinking a self join would do the trick, but I can't wrap my head around how to do that.

Are there any other ways to do this, without using, NOT IN( SELECT ... )

Also, what is the name for this type of problem?

A: 

You can LEFT JOIN and make sure that the joined table has no data in it (everything is null).

SELECT a.name, a.team 
    FROM bowlers a
    LEFT JOIN bowlers b
        ON b.name = a.name AND b.team = 'pin pals'
    WHERE a.team = 'The homer team' 
    AND a.name
    -- the join has to fail for this to be null
    AND b.bowling_id IS NULL
too much php
This definitely works, but is it any more or less efficient than his subquery? Seems like there'd be more overhead on the join, but I don't know.
chrissr
It is highly dependent on the table structure, what indexes are available, number of rows in the table, etc, how many people are in team A or team B, etc.
too much php
+2  A: 

Like this:

SELECT a.name, a.team
FROM bowlers a
LEFT OUTER JOIN bowlers b ON a.name = b.name AND b.team = 'pin pals'
WHERE a.team = 'The homer team'
AND b.name IS NULL;

You can also do it like this:

SELECT a.name, a.team
FROM bowlers a
WHERE a.team = 'The homer team'
AND NOT EXISTS (SELECT * FROM bowlers b
    WHERE b.team = 'pin pals'
    AND a.name = b.name
    );

By the way, this is called a "Left Anti-Semi Join".

RBarryYoung
Brilliant! Your first example certainly is an improvement to my problem. Still running a little slow (MySQL version 5.0.37) but a few... well, at least now it's returning!Thanks for the term to explain this by (Left Anti-Semi Join)
modern_prophet