title: Which is perfect Data Structure for exact string pattern matching?
body: <p>I am working on web content filtering where there is 10000 of words coming on a page. I have to match this with my 1500-2500words dictionary. And I have to find out whether any words present in the page or not.</p>
  
  <p>Please suggest me best data structure to store my pattern faster searching.
  I have studied Tree structure. But lets take a word (abc) that may have 26possibilities for a next character. I have to keep 26pointers for next node. (It consumes 26x4 Bytes). I cant spend that much memory for storing my patterns each word.</p>
  
  <p>Suggest me best searching and best in memory.</p>
  
  <p>I am beginner in this field.</p>