Multiple string pattern matching is one of the most important fundamental in solving string processing. This principle simultaneously searches for all patterns appeared in a large given text. A new algorithm to this problem called "IVL-MSPM" is presented. The new solution adapted the "Inverted lists" for accommodating the collection of patterns. The experimental results showed that the proposed data structures were constructed faster and more economic on space than the well-known data structures: Trie, reverted-Trie, and suffix tree.