Subject Re: trying to avoid large datasets
Author markd_mms
--- In, Florian Hector <FHector@...>
> What you need is the "levenshtein distance". This is an algorithm
that calculates how many single
> characters have to be swapped, added, shifted or left out to get two
strings to be the same.
> Ask aunt google for it, it returns a heap of sites.
> Florian

would i be better off writing it as a udf or a stored procedure?