First time here? Checkout the FAQ!
x
0 votes
512 views
asked in Machine Learning by (120 points)  

I have a result string like this A, C, D, F, B,

In my DB I have 10,000+ combinations like this 1. A, B, C, D   2. A, C, B, I, D, W, Z  etc.... 

Now I want to search for my result string with 10,000+ strings.

Which is the best way to map (string compare) and get the result match.

  

1 Answer

0 votes
answered by (116k points)  
I think the problem you mentioned can be solved using a tree structure such as Trie:
https://www.cs.helsinki.fi/u/tpkarkka/opetus/10s/spa/lecture07.pdf
...