Abstract: A data structure adapted for storage in a computer memory for receiving executable instructions. The data structure is a modified binary tree in the form of a quaternary tree guaranteeing at least two of four way branching at each internal node. In addition to the binary nodes, the tree may comprise a wildcard node and/or an epsilon node. The wildcard nodes point at keys of arbitrary descendants, and epsilon nodes reference an end of a data string at a specific length. In addition to the data structure, a method of traversing the data structure is disclosed for searching and retrieving data stored thereon. A method of modifying the data stored on the data structure is also disclosed. The searching algorithms include flags for controlling the tightness of a search and filters for searching prefixes and suffixes of a string. In conjunction with traversing the tree, a method of modifying the data structure is disclosed.

Abstract: A method of efficiently increasing intra-nodal page allocations and increasing processor cache utilization in a multiprocessing environment is provided. Each physical page of memory is identified and organized according to the page color as well as the nodal identifier. The organization process places each of the pages into a logical data structure. Both the identification and organization steps allow the system to properly select a page based upon both page color and nodal locale. In addition, the selection process updates the preferred page color for a subsequent page allocation. Accordingly, the method of identifying and organizing each page of memory enables an application to efficiently select pages with good processor cache distribution.