XPost: microsoft.public.sqlserver.programming   
   From: genew@ocis.net   
      
   On Wed, 13 Jul 2011 19:39:44 +0200, Gert-Jan Strik   
    wrote:   
      
   >A simple/simpler solution would be to always sort the values. In other   
   >words, to enforce that A is always lower or equal to B, both in the   
   >table and whenever you do inserts. That way you don't need two rows for   
   >each pair. In the table, this can be enforced with CHECK (a <= b)   
      
        You are over-optimising.  My example was an example of other rows   
   having to be checked, not the only such case.   
      
   Sincerely,   
      
   Gene Wirchenko   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)