Weighted Multidimensional B-trees Used as Nearly Optimal Dynamic Dictionaries

We suggest weighted (k+1) B-trees, k≥1, for weighted dynamic dictionaries of items with k-dimensional keys. It is shown that they compare favorably with a data structure recently introduced for the same application.

[1]  Kurt Mehlhorn,et al.  Arbitrary Weight Changes in Dynamic Trees , 1981, RAIRO Theor. Informatics Appl..

[2]  Kurt Mehlhorn.  Dynamic Binary Search , 1979, SIAM J. Comput..

[3]  Hans-Peter Kriegel,et al.  Multidimensional B-tree: An Efficient Dynamic File Structure for Exact Match Queries , 1980, GI Jahrestagung.

[4]  Kurt Mehlhorn,et al.  Codes: Unequal Probabilities, Unequal Letter Cost , 1980, JACM.

[5]  Hans-Peter Kriegel,et al.  Dynamic k-Dimensional Multiway Search under Time-Varying Access Frequencies , 1981, Theoretical Computer Science.

[6]  Robert E. Tarjan,et al.  Biased 2-3 trees , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).