Weighted multidimensional B-trees used as nearly optimal dynamic dictionaries

  • H. P. Kriegel
  • V. K. Vaishnavi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


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.


Time Complexity Access Time Ideal Time Access Path Operation Split 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Altenkamp, D. and Mehlhorn, K. (1980), Codes: Unequal probabilities, unequal letter costs, Journal of the ACM 27, 3 (July 1980), 412–427.Google Scholar
  2. 2.
    Bent, S.W., Sleator, D.D. and Tarjan, R.E. (1980), Biased 2–3 trees, Proc. 21st Annual Symposium on Foundations of Computer Science, 248–254.Google Scholar
  3. 3.
    Güting, H. and Kriegel, H.P. (1980), Multidimensional B-tree: An efficient dynamic file structure for exact match queries, Proc. 10th GI Annual Conference, Informatik Fachberichte Band 33, 375–388, Springer, Berlin-Heidelberg-New York.Google Scholar
  4. 4.
    Güting, H. and Kriegel, H.P. (1981), Dynamic k-dimensional multiway search under time-varying access frequencies, Proc. 5th GI-Conference on Theoretical Computer Science, Lecture Notes in Computer Science no. 104, 135–145, Springer, Berlin-Heidelberg-New York.Google Scholar
  5. 5.
    Kriegel, H.P. and Vaishnavi, V.K. (1981), A nearly optimal dynamic tree structure for partial-match queries with time-varying frequencies, Proc. 1981 Conference on Information Sciences and Systems, The Johns Hopkins University, Baltimore, Md., USA.Google Scholar
  6. 6.
    Mehlhorn, K. (1978), Arbitrary weight changes in dynamic trees, Bericht 78/04, Fachbereich 10 — Informatik, Universität des Saarlandes, Saarbrücken.Google Scholar
  7. 7.
    Mehlhorn, K. (1979), Dynamic binary search, SIAM J. COMPUTING 8,2 (May 1979), 175–198.Google Scholar
  8. 8.
    Sleator, D. and Tarjan, R.E. (1981), A data structure for dynamic trees, Proc. 13th Annual ACM Symposium on Theory of Computing, Milwaukee, Wisconsin, USA.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • H. P. Kriegel
    • 1
  • V. K. Vaishnavi
    • 2
  1. 1.Informatik VIUniversität DortmundDortmund 50W. Germany
  2. 2.Department of Computer ScienceOhio UniversityAthensUSA

Personalised recommendations