Storage optimization of tree structured files representing descriptor sets

Authors:
Theodore Rotwitt, Jr.;P. A. D. deMaine
Affiliations:
Pennsylvania State University, University Park, Pennsylvania;Pennsylvania State University, University Park, Pennsylvania
Venue:
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Year:
1971

Citing 6
Cited 2

Variable length tree structures having minimum average search time

Communications of the ACM
Use of tree structures for processing files

Communications of the ACM
Addressing multidimensional arrays

Communications of the ACM
Trie memory

Communications of the ACM
Agisar: a system for classifying digitized pictorial data

Agisar: a system for classifying digitized pictorial data
Automatic Information Organization and Retrieval.

Automatic Information Organization and Retrieval.

Analysis of a heuristic for full trie minimization

ACM Transactions on Database Systems (TODS)
Bibliography on data base structures

ACM SIGMIS Database

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that the total node requirements for tree structured files can be minimized without significantly affecting the search time. However, search times are determined primarily by type of use, and the particular implementation of tree structured files. In this paper theoretical results are reported for full and sparse files, and empirical techniques for minimizing total node requirements of tree structured files are given.