2. The method of claim 1 , wherein utilizing the binary representations of the suffix strings to form the first binary tree comprises: creating multiple levels of internal nodes; creating a level of external nodes; and grouping the external nodes into pairs with each pair being associated with one of the internal nodes.
1. A computer-implemented method of creating an index of web queries, comprising: receiving a first query representative of one or more non-alphanumeric symbolic characters; receiving a second query representative of another one or more non-alphanumeric symbolic characters, the first and the second queries sharing at least one common non-alphanumeric symbolic character; creating suffix strings corresponding to the first and the second queries; converting the suffix strings into binary representations; utilizing the binary representations of the suffix strings to form a first binary tree, nodes of the first binary tree having a plurality of queries incorporated therein and at least one of the nodes including an indication of a digit to compare to differentiate the binary representations corresponding to the first and the second queries; creating a first text string of alphanumeric characters representative of the one or more non-alphanumeric symbolic characters of the first query; creating a second text string of alphanumeric characters representative of the another one or more non-alphanumeric symbolic characters of the second query; incorporating, with the use of a processor, the first and the second text strings into a second binary tree capable of having a plurality of text strings incorporated therein, the second binary tree having at least one node that corresponds to one of the plurality of queries incorporated within the first binary tree.