Height-balanced trees of order (β, γ, δ)

DOI10.1145/3857.3858MaRDI QIDQ3685211zbMATH OpenOpenAlexFDO

Authors Shou-Hsuan S. Huang

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

zbMATH Keywords

algorithm analysisdata structuresdense multiway treesH-treesInsertion and deletion algorithmsrestricted classes of B-trees

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3845066
• Minimal-Cost Brother Trees
• Some average performance measures for the B-tree
• Space saving generalization of \(B\)-trees with \(2/3\) utilization
• Almost optimal dynamic 2-3 trees

Cited in

(14)

• Modeling B-tree insertion activity
• A model of the dynamic behavior of B-trees
• Unsafe operations in B-trees
• On generating B-trees with constant average delay and in lexicographic order
• Space saving generalization of \(B\)-trees with \(2/3\) utilization
• The average height of a node in the BANG abstract directory tree
• Insertions and deletions in B-trees
• scientific article; zbMATH DE number 3843183 (Why is no real title available?)
• scientific article; zbMATH DE number 3845066 (Why is no real title available?)
• scientific article; zbMATH DE number 3856424 (Why is no real title available?)
• scientific article; zbMATH DE number 3856447 (Why is no real title available?)
• scientific article; zbMATH DE number 4155928 (Why is no real title available?)
• Height-analysis of k-dimensional leaf and node height-balanced trees: A new approach
• Some average performance measures for the B-tree

This page was built for publication: Height-balanced trees of order (β, γ, δ)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685211)