PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Sprugnoli R. On the allocation of binary trees to secondary storage. In: Bit, vol. 21 pp. 305 - 316. Gruppo Editorial Jackson, 1981.
 
 
Abstract
(English)
Two paging techniques proposed by Muntz and Uzgalis to store a binary tree in secondary storage are considered. The first method (sequential allocation) is the basic allocation technique and here an exact formula is given, to be considered as a touchstone for every other method. Then a modification to the second method (grouped allocation) is proposed which gains control on storage utilization. This allows the structure to maintain both a high loading factor and a low retrieving time.
Subject binary trees
searching
information storage and retrieval
data organization
paging binary trees
combinatorial properties of trees


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