Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> efficient compare

efficient compare

From: Andersen <andersen_800_at_hotmail.com>
Date: Fri, 21 Apr 2006 12:50:43 +0200
Message-ID: <4448b904$0$16468$892e7fe2@authen.yellow.readfreenews.net> 





I have two sets A and B, each containing lots of key/value pairs. I want 
to compare them, to find out what is missing so that I can transfer 
whatever is needed from A to B and whatever is needed from B to A such 
that A=B. Any effective algorithms for that? Where should I look?



Rephrasing it in math terminology:


If I have two sets A, and B, containing tuples, and I want to find
complement(A intersect B), how do I do that efficiently?
Received on Fri Apr 21 2006 - 05:50:43 CDT












Original text of this message













  HOME |
  ASK QUESTION |
  ADD INFO |
  SEARCH |
  E-MAIL US