The Analysis of an Improved Symmetric Binary B-tree Algorithm

DOI10.1093/COMJNL/28.4.417MaRDI QIDQ3685213zbMATH OpenOpenAlexFDO

Authors Nivio Ziviani, H. Olivie, Gaston H. Gonnet

Publication date 1985

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/28.4.417

zbMATH Keywords

data structuresinsertion and deletion algorithmsymmetric binary B- trees

Mathematics Subject Classification ID

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

Recommendations

• A trivial algorithm whose analysis is not: a continuation
• Binary search trees of almost optimal height
• Analysis of the standard deletion algorithms in exact fit domain binary search trees
• Balancing binary trees by internal path reduction
• On k-dimensional balanced binary trees.

Cited in

(6)

• Modeling splits in file structures
• Expected behaviour of \(B^+\)-trees under random insertions
• Emerging behavior as binary search trees are symmetrically updated.
• scientific article; zbMATH DE number 1629950 (Why is no real title available?)
• scientific article; zbMATH DE number 3856447 (Why is no real title available?)
• The theory of fringe analysis and its application to 23 trees and b-trees

This page was built for publication: The Analysis of an Improved Symmetric Binary B-tree Algorithm

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