> You are now converting an O(1) or possibly O(log N) database lookup
> into an O(N) or possibly O(N log N) scan through the database (N is
> the number of keys in the database table.)

Yes, it did sound like it could grow unwieldy.  I just didn't know if there
might be some esoteric substring-match function that might have a practical
use here.  :/  LOL

Thanks for the feedback, David.  :)

Ken

