摘要 |
A processor-based system configured for searching in dynamically balanced trees is configured for linking the most often-searched elements of the tree to optimize search performance. Data elements include pointers for a tree-based index ordering and a doubly-linked list based index ordering. A background process links the most often-searched elements according to the linked list ordering and maintains the linked list ordering by first determining those elements having the highest importance values, defined as a number of times an element is successfully searched relative to aging or decay function. The linked list ordering is then arranged based on descending importance values. Each element also includes a go-to-tree flag, indicating to a search engine the point at which it is no longer beneficial to continue searching according to the doubly-linked list ordering. Hence, a search engine that begins searching the elements according to the doubly-linked list ordering will begin searching of the tree structure for the specified key entry in response to detecting an element having a go-to-tree flag set to true. Hence, the doubly-linked list may optimize search performance when the most often-searched elements may be deep within a tree, while insuring that unnecessary overhead is not introduced into the search routine.
|