Re: Bidirectional Binary Self-Joins

From: Marshall <marshall.spight_at_gmail.com>
Date: 1 Apr 2007 01:14:45 -0700
Message-ID: <1175415285.221875.155230_at_n76g2000hsh.googlegroups.com>


On Mar 31, 10:26 pm, "David Cressey" <cresse..._at_verizon.net> wrote:
> "Marshall" <marshall.spi..._at_gmail.com> wrote in message
>
> > > Unfortunately we are left with that same issue - the choice of team1
> > > and team2 is arbitrary, and as David or Paul pointed out, it means I
> > > have to do some jiggery pokery on my queries to consider both these

> > > different attributes simultaneously, even though they are playing the
> > > same roles. This obviously isn't going to kill us, but it doesn't seem
> > > elegant, so it niggles.
>
> > Get over it. :-)
>
> What if, instead of soccer, the game is Chinese checkers, where there can
> be up to six contenders in one game? Or how about tournament bridge, with
> say 30 pairs competing in a match?
>
> You could end up writing an awful lot of "or" expressions.

Yeah. At six you're likely looking for a new answer. But by that time you're probably not identifying games by the capricious collection of competing contingents.

Marshall Received on Sun Apr 01 2007 - 10:14:45 CEST

Original text of this message