Relaxed avl trees, main-memory databases and concurrency (Q2710798): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q126246048, #quickstatements; #temporary_batch_1721950759712
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: List processing in real time on a serial computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Organization and maintenance of large ordered indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrency of operations on B-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient rebalancing of chromatic search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-the-fly garbage collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Search and Insertion in AVL Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-the-fly optimization of data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic binary search trees: A structure for concurrent rebalancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Purely top-down updating algorithms for stratified search 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: Q4336276 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126246048 / rank
 
Normal rank

Latest revision as of 23:45, 26 July 2024

scientific article
Language Label Description Also known as
English
Relaxed avl trees, main-memory databases and concurrency
scientific article

    Statements

    Identifiers