Considered is the problem of storing items from a totally ordered set in a search tree so that the access time for a given item depends on a known estimate of the access frequency of the item. The authors described two related classes of biased search trees whose average access time is within a constant factor of the minimum and that are easy to update under insertions, deletions and more radical update operations. They also presented and analyzed efficient update algorithms for biased search trees. They listed several applications of such trees.
|Original language||English (US)|
|Number of pages||24|
|Journal||SIAM Journal on Computing|
|State||Published - 1985|
All Science Journal Classification (ASJC) codes
- Computer Science(all)