Understood. It is pretty technical and the topic is certainly advanced. Kudos to you for not only reading it but also not blindly using it because some guy on the internet said "it was best".

The performance problem you will run into is called SARGable. This comes from "search argumentable".

Think of your queries as though it is you looking through the phone book.

With what you are doing you want to find any of a list of possible values and those values are contained in a larger string. To use the phone book example you would have to look at every single name in the phone book to determine if the name is in your string. If instead you first parse your string you are no looking for absolute values. This means that sql can use its built in indexing. So if you don't have a value in your list that begins with the letter 'a', it won't even look in that part because it would be a waste of time. It can also find values like 'smith' far easier. It doesn't have to start with the first page and keep going until it finds smith. It will instead skip ahead large chunks of pages because searching the pages prior to that are pointless. Not sure if I am explaining this well, but hopefully you get the idea.

If you want some help with coding this you will need to post some ddl (create table scripts), sample data (insert statements) and desired output based on your sample data. The first article in my signature gives several example of the best way to post this stuff.