Binary search trees in secondary memory
WE Wright - Acta Informatica, 1980 - Springer
WE Wright
Acta Informatica, 1980•SpringerBinary search trees are shown to be reasonable alternatives to multiway trees for files stored
in magnetic bubble memory. An algorithm for maintaining AVL trees is shown to be by far the
most efficient of eight algorithms considered, when applied to secondary memory. A
simplified model for analyzing the AVL algorithm is developed. A practical AVL algorithm for
secondary memory is presented. Simulation results showing the performance of the AVL
algorithm and a basic nonbalancing algorithm are given.
in magnetic bubble memory. An algorithm for maintaining AVL trees is shown to be by far the
most efficient of eight algorithms considered, when applied to secondary memory. A
simplified model for analyzing the AVL algorithm is developed. A practical AVL algorithm for
secondary memory is presented. Simulation results showing the performance of the AVL
algorithm and a basic nonbalancing algorithm are given.
Summary
Binary search trees are shown to be reasonable alternatives to multiway trees for files stored in magnetic bubble memory. An algorithm for maintaining AVL trees is shown to be by far the most efficient of eight algorithms considered, when applied to secondary memory. A simplified model for analyzing the AVL algorithm is developed. A practical AVL algorithm for secondary memory is presented. Simulation results showing the performance of the AVL algorithm and a basic nonbalancing algorithm are given.
Springer
Showing the best result for this search. See all results