Insertion-safeness in balanced trees

DOI10.1016/0020-0190(83)90100-XzbMath0508.68042OpenAlexW2068700573MaRDI QIDQ1838043

Hans-Peter Kriegel, Y. S. Kwong

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90100-x

zbMATH Keywords

data structuresconcurrent operationsB-treesrandom insertion2-3-treesdeepest safe node

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrent search and insertion in 2-3 trees
• Concurrency of operations on B-trees
• On random 2-3 trees
• Organization and maintenance of large ordered indexes
• Efficient locking for concurrent operations on B-trees
• A New Method for Concurrency in B-Trees

This page was built for publication: Insertion-safeness in balanced trees