Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations (Q1857041): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:17, 1 February 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
