On the allocation of binary trees to secondary storage

DOI10.1007/BF01941465zbMath0472.68059MaRDI QIDQ1157927

Renzo Sprugnoli

Publication date: 1981

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

searchinginformation storage and retrieval21, 305-316 (1981)combinatorial properties of treesdata organizationpaging binary trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (1)

Counting labels in binary trees

Cites Work

• A comparative study of very large data bases
• Sequence search trees: Their analysis using recurrence relations
• Dynamic hashing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the allocation of binary trees to secondary storage