Sabine Hanke  Home/Search
Context
Related
| informatik.unifrei...report00115.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unifreibur...complete (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Relaxed balancing has become a commonly used concept in the design of concurrent search tree algorithms. The idea of relaxed balancing is to uncouple the rebalancing from the updating in order to speed up the update operations and to allow a high degree of concurrency. Many different relaxed balancing algorithms have been proposed, especially for red-black trees and AVL trees, but their performance in concurrent environments is not yet well understood. This paper presents an experimental... (Update)
Active bibliography (related documents): More All
3.1: Complexity of Layered Binary Search Trees with Relaxed Balance - Jacobsen, Larsen (1999) (Correct)
1.6: Chromatic Search Trees Revisited - Hanke (1997) (Correct)
1.2: Relaxed Balanced Red-Black Trees - Hanke, Ottmann, Soisalon-Soininen (1997) (Correct)
Similar documents based on text: More All
1.2: Efficient Rebalancing of Chromatic Search Trees - Boyar, Larsen (1993) (Correct)
0.6: A New Weight Balanced Binary Search Tree - Cho, Sahnit (Correct)
0.5: Supernode Binary Search Trees - Haejae Jung And (Correct)
BibTeX entry: (Update)
@article{ hanke99performance,
author = "Sabine Hanke",
title = "The Performance of Concurrent Red-Black Tree Algorithms",
journal = "Lecture Notes in Computer Science",
volume = "1668",
pages = "286--??",
year = "1999",
url = "citeseer.ist.psu.edu/hanke98performance.html" }
Citations (may not include all citations):124 A dichromatic framework for balanced trees (context) - Guibas, Sedgewick - 1978
116 Planar point location using persistent search trees (context) - Sarnak, Tarjan - 1986
80 Efficient locking for concurrent operations on B-trees (context) - Lehman, Yao - 1981
40 Reactive synchronization algorithms for multiprocessors - Lim, Agarwal - 1994
34 trees with overtaking (context) - Sagiv, on - 1986
25 Concurrency control in database structures with relaxed bala.. (context) - Nurmi, Soisalon-Soininen et al. - 1987
22 fly optimization of data structures (context) - Kessels - 1983
22 A symmetric concurrent B-tree algorithm (context) - Lanin, Shasha - 1986
21 tree concurrency control algorithms (context) - Srinivasan, Carey et al. - 1991
21 A framework of the performance analysis of concurrent b-tree.. (context) - Johnson, Shasha - 1990
17 AVL trees with relaxed balance - Larsen - 1994
14 Efficient rebalancing of chromatic search trees - Boyar, Larsen - 1994
13 Prentice Hall International Editions (context) - Akl, Analysis et al. - 1989
13 Uncoupling updating and rebalancing in chromatic binary sear.. (context) - Nurmi, Soisalon-Soininen - 1991
11 trees with relaxed balance (context) - Larsen, Fagerberg - 1995
10 Amortization results for chromatic search trees (context) - Boyar, Fagerberg et al. - 1995
6 The performance implications of spin lock alternatives for s.. (context) - Anderson - 1990
6 Relaxed balancing in search trees (context) - Soisalon-Soininen, Widmayer - 1997
5 ACM Transactions on Database Systems (context) - Johnson, Shasha et al. - 1993
5 Chromatic binary search trees: A structure for concurrent re.. (context) - Nurmi, Soisalon-Soininen - 1996
5 Concurrent rebalancing on hyperred-black trees (context) - Gabarr'o, Messeguer et al. - 1997
5 Relaxed balance through standard rotations - Larsen, Soisalon-Soininen et al. - 1997
5 Relaxed balancing made simple - Ottmann, Soisalon-Soininen - 1995
4 Concurrent rebalancing of AVL trees: A fine-grained approach (context) - Boug'e, Gabarr'o et al. - 1997
4 Relaxed balanced red-black trees - Hanke, Ottmann et al. - 1997
4 Concurrent rebalancing of AVL trees: A fine-grained approach (context) - Boug'e, Gabarr'o et al. - 1997
3 Relaxed balance for search trees with local rebalancing - Larsen, Ottmann et al. - 1997
3 Amortized constant relaxed rebalancing using standard rotati.. - Larsen - 1998
2 Hyperchromatic trees: a fine-grained approach to distributed.. - Messeguer, Valles - 1998
2 On Updating and Balancing Relaxed Balanced Search Trees in M.. (context) - Malmi - 1997
2 Concurrent search in AVL-trees (context) - Ellis - 1980
1 Chromatic search trees revisited - Hanke - 1997
1 A new method for updating and rebalancing tree-type main mem.. (context) - Malmi - 1996
Documents on the same site (http://www.informatik.uni-freiburg.de/tr/complete.html): More
Approximation and Existential Second-Order Logic - Ihler (1990) (Correct)
New Methodes for Sequential Hashing with Supertrace - Eckerle, Lais (Correct)
Parallel Searching on m Rays - Hammar, Nilsson, Schuierer (2001) (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