See this document in CiteSeerX!

Height-relaxed AVL rebalancing: A unified, fine-grained approach to concurrent dictionaries (1998)  (Make Corrections)  
Luc Bougé, Joaquim Gabarró, Xavier Messeguer, Nicolas Schabanel



  Home/Search   Context   Related

 
View or download:
lsi.upc.es/dept/techreps...R9812.ps.gz
lip.enslyon.fr/pub/LIP/...RR9818.ps.Z
lip.enslyon.fr/pub/LI...RR199818.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  lsi.upc.es/dept/techreps/1998 (more)
From:  enslyon.fr/~bouge/Pa...ParaDigme
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a rebalancing may for instance be necessary after successive insertions and deletions of keys. We show that this problem can be studied through the self-reorganization of distributed systems of nodes controlled by local evolution rules in the line of the approach of Dijkstra and Scholten. This yields a much simpler algorithm that the ones previously known. Based on the basic rebalancing framework, we... (Update)

Similar documents (at the sentence level):
11.9%:   Concurrent rebalancing of AVL trees: A fine-grained approach - Extended   (Correct)

Active bibliography (related documents):   More   All
1.5:   A Unified Approach to Concurrent and Parallel Algorithms on .. - Gabarro, Messeguer   (Correct)
0.9:   The Performance of Concurrent Red-Black Tree Algorithms - Hanke (1998)   (Correct)
0.5:   MacroSplit - Insertion Algorithms   (Correct)

Similar documents based on text:   More   All
0.5:   Chromatic Search Trees Revisited - Hanke (1997)   (Correct)
0.4:   Relaxed AVL Trees, Main-Memory Databases, and Concurrency - Nurmi, Soisalon-Soininen.. (1996)   (Correct)
0.4:   Concurrent AVL revisited: self-balancing distributed.. - Bouge, Gabarro, Messeguer (1995)   (Correct)

BibTeX entry:   (Update)

@misc{ boug-heightrelaxed,
  author = "Luc Bougé and Joaquim Gabarró and Xavier Messeguer and Nicolas Schabanel",
  title = "Height-relaxed AVL rebalancing: A unified, fine-grained approach to concurrent
    dictionaries",
  url = "citeseer.ist.psu.edu/78093.html" }
Citations (may not include all citations):
2003   The art of computer programming (context) - Knuth - 1973
124   A dichromatic framework for balanced trees (context) - Guibas, Sedwick - 1978
77   Concurrency of operations on B-trees (context) - Bayer, Schkolnick - 1977
63   An algorithm for the organization of the information (context) - Adel'son-Vel'skii, Landis - 1962
25   Concurrency control in database structures with relaxed bala.. (context) - Nurmi, Soisalon-Soininen et al. - 1987
24   Analysis of algorithms (context) - Sedgewick, Flajolet - 1996
22   Concurrent search and insertion in AVL trees (context) - Ellis - 1980
17   AVL trees with relaxed balance - Larsen - 1994
7   Homomorphisms between models of parallel computation (context) - Kasai, Miller - 1982
7   the fly garbage collection: an exercice in cooperation (context) - Dijkstra, Lamport et al. - 1978
7   brother trees or AVL trees revisited (context) - Ottmann, Wood - 1979
6   Concurrent AVL revisited: self-balancing distributed search .. - Boug'e, Gabarr'o et al. - 1995
6   Relaxed balancing in search trees (context) - Soisalon-Soininen, Widmayer - 1997
5   Concurrent rebalancing on HyperRed-Black trees (context) - Gabarr'o, Messeguer et al. - 1997
4   Concurrent rebalancing of AVL trees: a fine-grained approach (context) - Boug'e, Gabarr'o et al. - 1997
3   Languages and Systems (context) - Francez, ACM et al. - 1980
3   Concurrent manipulation of binary serch trees (context) - Kung, Lehman - 1980
3   the fly optimisation of data structures (context) - Kessels - 1983
3   Concurrent balancing and updationg of AVL trees (context) - Nurmi, Soisalon-Soininen et al. - 1992
3   the correspondence between AVL trees and brother trees (context) - Ottmann, Six et al. - 1979
2   A unified approach to concurrent and parallel algorithms on .. (context) - Gabarr'o, Messeguer - 1997
2   a structure for concurrent rebalancing (context) - Nurmi, Soisalon-Soininen et al. - 1996
1   Chromatic binary search trees (context) - Nurmi, Soisalon-Soininen - 1996

Documents on the same site (http://www.lsi.upc.es/dept/techreps/1998.html):   More
Partial Match Queries in Relaxed Multidimensional.. - Martínez.. (1998)   (Correct)
Multiresolution for Algebraic Curves and Surfaces Using.. - Esteve, Brunet, Vinacua (1998)   (Correct)
On the Complexity of Moving Vertices in a Graph - Lozano, Raghavan (1998)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC