Unsafe operations in B-trees

DOI10.1007/BF00289145zbMath0677.68117MaRDI QIDQ1123655

Bin Zhang, Meichun Hsu

Publication date: 1989

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items

Deletion without rebalancing in multiway search trees ⋮ \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half ⋮ The SB-tree: An index-sequential structure for high-performance sequential access

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrent operations on \(B^ *\)-trees with overtaking
• On random 2-3 trees
• Organization and maintenance of large ordered indexes
• Height-balanced trees of order (β, γ, δ)
• Time- and space-optimality in B-trees
• Efficient locking for concurrent operations on B-trees