8. A computer-implemented method of creating an index of web queries, comprising: receiving a first query representative of a plurality of non-alphanumeric symbolic characters; creating a first suffix string corresponding to a last one of the plurality of non-alphanumeric symbolic characters; creating a second suffix string corresponding to the last one of the plurality of non-alphanumeric symbolic characters and at least an additional one of the plurality of non-alphanumeric symbolic characters, creating a third suffix string corresponding to all of the plurality of non-alphanumeric symbolic characters; incorporating the first query into a first binary tree capable of having a plurality of queries incorporated therein, the first binary tree having external nodes that correspond to the first, the second, and the third suffix strings; creating a first text string of alphanumeric characters representative of the plurality of non-alphanumeric symbolic characters of the first query; incorporating, with the use of a processor, the first text string into a second binary tree capable of having a plurality of text strings incorporated therein; and associating the first text string with the first, the second, and the third suffix strings.
8. A computer-implemented method of creating an index of web queries, comprising: receiving a first query representative of a plurality of non-alphanumeric symbolic characters; creating a first suffix string corresponding to a last one of the plurality of non-alphanumeric symbolic characters; creating a second suffix string corresponding to the last one of the plurality of non-alphanumeric symbolic characters and at least an additional one of the plurality of non-alphanumeric symbolic characters, creating a third suffix string corresponding to all of the plurality of non-alphanumeric symbolic characters; incorporating the first query into a first binary tree capable of having a plurality of queries incorporated therein, the first binary tree having external nodes that correspond to the first, the second, and the third suffix strings; creating a first text string of alphanumeric characters representative of the plurality of non-alphanumeric symbolic characters of the first query; incorporating, with the use of a processor, the first text string into a second binary tree capable of having a plurality of text strings incorporated therein; and associating the first text string with the first, the second, and the third suffix strings. 9. The method of claim 8 wherein the first, the second, and the third suffix strings have a common non-alphanumeric symbolic character.