Paging binary trees with external balancing

DOI10.1007/3-540-52292-1_19MaRDI QIDQ4694757zbMATH OpenFDO

Authors Andreas Henrich, Hans-Werner Six, Peter Widmayer

Publication date 29 June 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-52292-1_19

zbMATH Keywords

data structureexternal balancingpartially paged binary tree principle

Mathematics Subject Classification ID

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

Recommendations

• Balancing binary trees by internal path reduction
• Unbalanced multiway trees improved by partial expansions
• Binary search trees of almost optimal height
• Multidimensional balanced binary trees
• scientific article; zbMATH DE number 4060691

Cited in

(2)

• Unbalanced multiway trees improved by partial expansions
• On the size of paged recursive trees

This page was built for publication: Paging binary trees with external balancing

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