Doubly-chained tree data base organisation--analysis and design strategies

Abstract

Doubly-chained tree data base (file) structures are analysed and modelled, taking into account realistic implementation-oriented factors. Formulations for average access time and storage requirements are derived, showing the effect on performance and the interrelation of the characteristics of the contents of the data base, the complexity of the queries, storage device characteristics and processing times, and implementation-oriented (e.g. storage mapping) alternatives. Performance results are obtained from these models for six real life data bases. The doubly-chained alternatives are compared and evaluated to provide practical design guidelines and strategies.