© 1977 by British Computer Society
Doubly-chained tree data base organisationanalysis and design strategies

1 Computer Science Department, School of Engineering and Applied Science, University of California, Los Angeles, USA, 2 US Navy Weapons Centre, Department of the Navy, Corona, California, USA
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.
Received March 1975.
* Computer Science Department School of Engineering and Applied Science, University of California, Los Angeles, Los Angeles, California 90024, USA. Portion of this work done while on leave at the IBM Research Laboratory, San Jose, California, USA.
US Navy Weapons Centre, Department of the Navy, Corona, California 91720, USA.