Re: efficient compare

From: Bob Badour <bbadour_at_pei.sympatico.ca>
Date: Fri, 21 Apr 2006 13:46:30 GMT
Message-ID: <Wm52g.63650$VV4.1189433@ursa-nb00s0.nbnet.nb.ca>

Andersen wrote:

> 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?

The efficiency will depend on the physical structure representing the sets and on the costs of indexes or sorts.

Is this for a course you are taking? Received on Fri Apr 21 2006 - 08:46:30 CDT