Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations (Q1857041): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0255(02)00261-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092147036 / rank | |||
Normal rank | |||
Latest revision as of 12:00, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations |
scientific article |
Statements
Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations (English)
0 references
11 February 2003
0 references
concurrent B-trees
0 references
concurrency control
0 references
bottom-up tree restructuring
0 references
