## Optimum Binary Search Trees On The Hierarchical Memory Model (2001)

Citations: | 8 - 1 self |

### BibTeX

@MISC{Thite01optimumbinary,

author = {Shripad Thite},

title = {Optimum Binary Search Trees On The Hierarchical Memory Model},

year = {2001}

}

### OpenURL

### Abstract

The Hierarchical Memory Model (HMM) of computation is similar to the standard Random Access Machine (RAM) model except that the HMM has a non-uniform memory organized in a hierarchy of levels numbered 1 through h. The cost of accessing a memory location increases with the level number, and accesses to memory locations belonging to the same level cost the same. Formally, the cost of a single access to the memory location at address a is given by (a), where : N ! N is the memory cost function, and the h distinct values of model the different levels of the memory hierarchy. We study the problem of constructing and storing a binary search tree (BST) of minimum cost, over a set of keys, with probabilities for successful and unsuccessful searches, on the HMM with an arbitrary number of memory levels, and for the special case h = 2. While the problem of constructing optimum binary search trees has been well studied for the standard RAM model, the additional parameter for the HMM inc...