Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations (Q1857041)
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: Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations |
scientific article; zbMATH DE number 1866954
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations |
scientific article; zbMATH DE number 1866954 |
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
