Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations (Q1857041)

From MaRDI portal
Revision as of 12:37, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    11 February 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    concurrent B-trees
    0 references
    concurrency control
    0 references
    bottom-up tree restructuring
    0 references