Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations (Q1857041): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Concurrency of operations on B-trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient locking for concurrent operations on B-trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Method for Concurrency in B-Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Concurrent operations on \(B^ *\)-trees with overtaking / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Concurrent search structure algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4274970 / rank | |||
Normal rank |
Revision as of 12:32, 5 June 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