Acta Informatica

, Volume 35, Issue 10, pp 859–874 | Cite as

Amortized constant relaxed rebalancing using standard rotations

  • Kim S. Larsen


The idea of relaxed balance is to uncouple the rebalancing in search trees from the updating in order to speed up request processing in main-memory databases. This paper defines the first relaxed binary search tree with amortized constant rebalancing using only standard single or double rotations.


Search Tree Binary Search Binary Search Tree Request Processing Constant Rebalancing 
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.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Kim S. Larsen
    • 1
  1. 1. Department of Mathematics and Computer Science, Odense University, Campusvej 55, DK-5230 Odense M, Denmark DK

Personalised recommendations