Height-balanced trees of order (β, γ, δ)
From MaRDI portal
Publication:3685211
DOI10.1145/3857.3858zbMath0568.68047OpenAlexW2009884588MaRDI QIDQ3685211
Publication date: 1985
Published in: ACM Transactions on Database Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3857.3858
data structuresalgorithm analysisdense multiway treesH-treesInsertion and deletion algorithmsrestricted classes of B-trees
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (3)
Modeling B-tree insertion activity ⋮ Space saving generalization of \(B\)-trees with \(2/3\) utilization ⋮ Unsafe operations in B-trees
This page was built for publication: Height-balanced trees of order (β, γ, δ)