List:General Discussion« Previous MessageNext Message »
From:(Hal Date:April 30 2011 3:01pm
Subject:Re: FW: Join based upon LIKE
View as plain text  
>>>> 2011/04/28 15:28 -0400, Jerry Schwartz >>>>
No takers?
<<<<<<<<
And this is not real taking, because the algorithm of which I am thinking, the
edit-distance (Levens(h)tein-distance) algorithm costs too much for you (see the
Wikipedia entry), but it yields, I believe, much more nearly such answer as you want.

The obvious implementation takes as many steps as the product of the two compared strings
s length. On the other hand, a good implementation of "LIKE" costs the pattern s length
added to all the strings against which it matches s length, a sum, not product, of
lengths.

Thread
FW: Join based upon LIKEJerry Schwartz28 Apr
  • Re: Join based upon LIKEJohan De Meersman28 Apr
    • RE: Join based upon LIKEJerry Schwartz29 Apr
      • Re: Join based upon LIKEJohan De Meersman29 Apr
        • RE: Join based upon LIKEJerry Schwartz29 Apr
  • Re: FW: Join based upon LIKEhsv30 Apr
RE: Join based upon LIKEJerry Schwartz29 Apr
  • Re: Join based upon LIKEJohan De Meersman1 May
    • RE: Join based upon LIKEJerry Schwartz2 May
      • Re: Join based upon LIKEJohan De Meersman3 May
        • RE: Join based upon LIKEJerry Schwartz3 May
          • Re: Join based upon LIKEJohan De Meersman3 May
            • Re: Join based upon LIKEshawn wilson3 May
              • RE: Join based upon LIKEJerry Schwartz3 May
                • Re: Join based upon LIKENuno Tavares4 May
                  • RE: Join based upon LIKEJerry Schwartz5 May
Re: FW: Join based upon LIKEhsv30 Apr