Amortized constant relaxed rebalancing using standard rotations (Q1127819): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s002360050145 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082993995 / rank | |||
Normal rank | |||
Latest revision as of 22:48, 19 March 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
