Patent ID: 6047283
Filing Date: 2000-04-04
Classification: G06F,Y10S

Abstract:
A search tree for indexing a plurality of string entries, wherein each one of said plurality of string entries is a string of characters, comprising:a plurality of linked nodes consisting of a root node, a plurality of inner nodes wherein each one of said plurality of inner nodes is associated with a character or substring of characters, and a plurality of leaf nodes, wherein said each one of said plurality of inner nodes further comprises:(a) a reference to a parent node, wherein said parent node is either said root node or another of said plurality of inner nodes;(b) a first data field containing a character comparison position indicating the number of characters in said character or substring of characters associated with said one of said plurality of inner nodes;(c) a second data field containing a comparison character, said comparison character used to determine whether said character or substring of characters associated with said one of said plurality of inner nodes is contained in a string entry at a character position of said string entry associated with said character comparison position;(d) a reference to at least two successor nodes; and(e) a hash table array containing a predetermined number of hash buckets.