Amortized constant relaxed rebalancing using standard rotations (Q1127819): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:03, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Amortized constant relaxed rebalancing using standard rotations |
scientific article |
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
