On Updating and Balancing Relaxed Balanced Search Trees in Main Memory

@inproceedings{Malmi1997OnUA,
  title={On Updating and Balancing Relaxed Balanced Search Trees in Main Memory},
  author={Lauri Malmi},
  year={1997}
}
In this thesis, various methods for maintaining balanced search trees in main memory are considered. The work concentrates on algorithms applying relaxed balancing in which updates and rebalancing are uncoupled from each other. A new relaxed balanced tree, the rank-valued tree, which is a relaxed version of symmetric binary B-trees, also known as red-black trees, is introduced and analyzed. Rank-valued trees have the following benefits compared with chromatic trees, an older relaxed version of… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 103 references

E

  • O. Nurmi
  • Soisalon-Soininen, D .Wood, Relaxed AVL Trees…
  • 1996
Highly Influential
20 Excerpts

Similar Papers

Loading similar papers…