i think bitwise search could be pretty fast.
how?
tokenize data. each token is given a bit position. if token exists in data bit is 1, otherwise its 0.
now find relevant rows in data with given input tokens.
for example search could be:
token1, token455, token664
create bitmask from the input data and apply to search data rows to find relevant results.