Identifier Search Mechanisms: A Survey and Generalized Model
ACM Computing Surveys (CSUR)
Analysis and performance of inverted data base structures
Communications of the ACM
Use of tree structures for processing files
Communications of the ACM
Communications of the ACM
Some generalized modeling structures for use in design of file organizations.
Some generalized modeling structures for use in design of file organizations.
Evaluation and optimization of file organizations through analytic modeling.
Evaluation and optimization of file organizations through analytic modeling.
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
Approximating block accesses in database organizations
Communications of the ACM
Application of an analytical model to evaluate storage structures
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Selection of file organization using an analytic model
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
| Hi-index | 0.02 |
Storage structure alternatives exist for structuring symbol trees. Sequential structure is used in Trie and linked list structure is used in Doubly Chained Tree. A model of hybrid tree structures is presented which employs storage structures at levels where they are most efficient. The model parameters are determined by the densities of key components. A related hit ratio problem is solved so that these densities can be estimated. Analyses are given to determine appropriate tree structures from the model.