Amortized constant relaxed rebalancing using standard rotations (Q1127819)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Amortized constant relaxed rebalancing using standard rotations |
scientific article; zbMATH DE number 1186251
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Amortized constant relaxed rebalancing using standard rotations |
scientific article; zbMATH DE number 1186251 |
Statements
Amortized constant relaxed rebalancing using standard rotations (English)
0 references
29 March 1999
0 references
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.
0 references
search trees
0 references
amortized constant rebalancing
0 references
0.82179874
0 references
0.81771743
0 references
0.80783784
0 references
0.80681247
0 references
0.8064237
0 references
0.79793465
0 references
0.7965696
0 references
0.7938559
0 references
0.7903673
0 references
