Concurrency control in database structures with relaxed balance

Nurmi, Otto; Soisalon-Soininen, Eljas; Wood, Derick

doi:10.1145/28659.28677

Cited by 51 publications

(34 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The extended version of this paper shows that this is the case for the algorithms of Ellis Ell80], Kessels Kes83], Nurmi and al. NSSW87,NSSW92], and Larsen Lar94]. The initial sequential AVL algorithm even appears as a limit case.…”

Section: Resultsmentioning

confidence: 99%

Concurrent rebalancing of AVL trees: A fine-grained approach

Bougé

Gabarró

Messeguer

et al. 1997

Euro-Par'97 Parallel Processing

View full text Add to dashboard Cite

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 s h o w t h a t this problem can be studied through the self-reorganization of distributed systems of nodes controlled by l o c a l e v olution rules in the line of the approach of Dijkstra and Scholten. This yields a much simpler algorithm that the ones previously known. As a by-product, this solves in a very general setting an old question raised by H.T. Kung and P.L. Lehman: where should rotations take place to rebalance arbitrary search trees?

show abstract

Section: Resultsmentioning

confidence: 99%

Concurrent rebalancing of AVL trees: A fine-grained approach

Bougé

Gabarró

Messeguer

et al. 1997

Euro-Par'97 Parallel Processing

View full text Add to dashboard Cite

show abstract

“…The analysis of the behavior of a relaxed version of AVL trees [1] introduced in [22] was given in [17]. The structure chromatic search tree of interest in this paper is a relaxed version of red black trees [3,9].…”

Section: Introductionmentioning

confidence: 99%

“…Both of the common B-trees [4], 2-3 trees [2,10], and 2-3-4 trees [9] have relaxed versions, the properties of which are also discussed in [18]. The first relaxed version of a B-tree is from [22]. Some implementation experience with a modified version of [8] can be found in [20].…”

Section: Introductionmentioning

confidence: 99%

Amortization results for chromatic search trees, with an application to priority queues

Boyar¹,

Fagerberg²,

Larsen³

1995

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The intention in designing data structures with relaxed balance, such as chromatic search trees, is to facilitate fast updating on shared-memory asynchronous parallel architectures. To obtain this, the updating and rebalancing have been uncoupled, so extensive locking in connection with updates is avoided. In this paper, we prove that only an amortized constant amount of rebalancing is necessary after an update in a chromatic search tree. We also prove that the amount of rebalancing done at any particular level decreases exponentially, going from the leaves toward the root. These results imply that, in principle, a linear number of processes can access the tree simultaneously. We have included one interesting application of chromatic trees. Based on these trees, a priority queue with possibilities for a greater degree of parallelism than previous proposals can be implemented. ] 1997 Academic Press

show abstract

“…When a problem is found, rebalancing can be performed provided that the tag value of the parent node is at least zero (see the appendix, operations 3 and 4). Notice that in [8], t u must be zero, whereas we only require that t u be different from −1, thus allowing for a significantly higher degree of concurrency. If one of the two children of u has tag value −1 and the other has tag value greater than zero, then we require that the negative tag value be taken care of first.…”

Section: Avl Trees With Relaxed Balancementioning

confidence: 99%

“…For the complexity analysis, we follow [8] in assuming that initially the search tree is an AVL tree, and then a series of search, insert, and delete operations occur. These operations may be interspersed with rebalancing operations.…”

Section: Complexitymentioning

confidence: 99%

AVL Trees With Relaxed Balance

Larsen¹

1992

DPB

View full text Add to dashboard Cite

AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating from rebalancing. An additional benefit is that rebalancing can be controlled separately. In particular, it can be postponed completely or partially until after peak working hours.We define a new collection of rebalancing operations which allows for a significantly greater degree of concurrency than the original proposal. Additionally, in contrast to the original proposal, we prove the complexity of our algorithm.If N is the maximum size of the tree, we prove that each insertion gives rise to at most log φ (N +

show abstract

Concurrency control in database structures with relaxed balance

Cited by 51 publications

References 13 publications

Concurrent rebalancing of AVL trees: A fine-grained approach

Concurrent rebalancing of AVL trees: A fine-grained approach

Amortization results for chromatic search trees, with an application to priority queues

AVL Trees With Relaxed Balance

Contact Info

Product

Resources

About