International Business Machines Corporation
Optimizing hash storage and memory during caching

Abstract:

Technique for adding new key values (that is, new strings of binary digits that can be obtained by concatenating node values of nodes on a path through a tree) to a tree where each node corresponds to an ordered string of binary digits. When integrating the new key value, an XOR function is used to find an appropriate insertion location node (sometimes called a "selected parent node") by efficiently finding the node that represents a path value (that is, concatenated value) that includes the longest prefix and a dissimilar suffix. Once the parent node is selected, the child nodes of this selected parent node are added and/or re-arranged to accommodate the new key value.