PACKED RADIX SEARCH TREE IMPLEMENTATION

A packed radix data system is described, the packed radix data system including packed nodes which include a base pointer and an existence field, the existence field having a number of bits which indicate the existence or non-existence of a possible child node. By counting the number of bits to the left of an indexed bit in the existence field, an offset value is determined. The offset value is combined with the base pointer value to determine the child node address.