Which algorithm for finding substrings in a list of tuples will be faster than comprehension?

Question

Python

Given: A list of about 100k tuples. Each tuple has two elements, the first is an id and the second is a string. It is necessary to select all id from those tuples where the strings contain a certain substring.

tuples = [(id1, 'cheese trees'), (id2, 'freezy breeze'),...]
vals = ['cheese', 'flees']
ids = {i[0] for i in tuples if any(val in i[1] for val in vals)}

output: {id1}

Now I do it through comprehension, but there must be a faster algorithmic solution! Here is what I am looking for.

Answer 1

Aho-Korasik algorithm .
Put all your keys into the burr, as described in the link. Then for each tuple, search in the i[1] line, if found, then add your id to the answer.

Answer 2

To create a "search" index of these lines, you can get confused yourself, but it's easier to put it in the database and create an index there.