David Weldon wrote:
> Problem: 1 million+ strings (Set A) need to be matched with 1 million+
> substrings (Set B). For example:
> 
> Set A =
> iliketotraveltohawaii
> travelmagazine
> 
> Set B =
> travel
> hawaii
> 
> A(1,2) match "travel"
> A(1) matches "hawaii"
> 
> What is the best approach to take with this problem? 

Bloom filters?  It's the fastest thing I can think of.

-- 
Alex