Efficient locking for concurrent operations on B-trees (Q3917524): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56039645, #quickstatements; #temporary_batch_1706974288397
Created claim: DBLP publication ID (P1635): journals/tods/LehmanY81, #quickstatements; #temporary_batch_1731475607626
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/319628.319663 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108179552 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tods/LehmanY81 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:16, 13 November 2024

scientific article
Language Label Description Also known as
English
Efficient locking for concurrent operations on B-trees
scientific article

    Statements

    Efficient locking for concurrent operations on B-trees (English)
    0 references
    0 references
    0 references
    1981
    0 references
    database
    0 references
    data structures
    0 references
    index organizations
    0 references
    concurrent algorithms
    0 references
    concurrency controls
    0 references
    locking protocols
    0 references
    correctness
    0 references
    consistency
    0 references
    multiway search trees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references