Patent ID: 6959303

Claim:
A computer-implemented method of determining if a query element is included in a set of elements comprising one or more elements from a first domain having a character set of “m” characters, wherein “Z” is the maximum possible length of an element in the first domain and “Y” is the length of the longest element in the set of elements such that 1≦Y≦Z, the method comprising: building a data structure based upon the set of elements, the data structure comprising a plurality of memory structures headed by a root memory structure, each memory structure in the plurality of memory structures comprising a first memory location and an array of “m” memory locations; receiving information identifying the query element; and using the data structure to determine if the query element is included in the set of elements such that the number of comparisons needed to determine if the query element is included in the set of elements is proportional to a length of the query element and independent of the number of elements in the set of elements.