SELF-ADJUSTING MULTIWAY SEARCH-TREES

被引：11
|
作者：
MARTEL, C
机构：
[1] Division of Computer Science, University of California, Davis, Davis
来源：
INFORMATION PROCESSING LETTERS | 1991年 / 38卷 / 03期
基金：
美国国家科学基金会;
关键词：
DATA STRUCTURES; ANALYSIS OF ALGORITHMS; DICTIONARY; ONLINE ALGORITHMS;
D O I：
10.1016/0020-0190(91)90235-A
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We introduce a new data structure, the k-forest, which is a self-adjusting multi-way search tree. A k-forest provides an efficient implementation of a weighted Dictionary in a virtual memory environment where the time to access a tree node is much greater than the time to examine data items in a node. We achieve results that are natural generalizations of the Working Set and Static Optimality theorems of Sleator and Tarjan for splay trees. Thus we are able to show that even when the lookup frequencies of the elements of the dictionary are not known in advance, a k-forest can equal or exceed the performance of an optimal static multi-way tree which is built knowing the lookup frequencies in advance.
引用
收藏
页码：135 / 141
页数：7
相关论文
共 50 条
12345