Istituto di Scienza e Tecnologie dell'Informazione     
Cesarini F., Grazzini E., Pinzani R., Pippolini F., Soda G., Sprugnoli R. Paging AVL trees. In: 3eme Colloque de Lille: les arbres en algebre et en programmation (Universite' de Lille, 1978). Proceedings, 1978.
In this paper, besides some results on static paging of AVL trees, we investigate how balancing methods interact with paging techniques. To this purpose we introduce the concept of average page path length" as the average number of accesses to pages nece5sary to find a node in a paged tree; this a measure of the performance of any method. We study how the page path length is changed by rotations end how the tree modifies its page balancing. We propose an algorithm to limit the possible loss of page balance, the improvement so obtained is shown by experimental results.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional