Analysis of storage structure performance for multiple data processing activities

Authors:
Toby J. Teorey;John W. DeHeus
Affiliations:
Department of Electrical and Computer Engineering, Program in Computer, Information and Control Engineering (CICE), The University of Michigan, Ann Arbor, Michigan;Department of Electrical and Computer Engineering, Program in Computer, Information and Control Engineering (CICE), The University of Michigan, Ann Arbor, Michigan
Venue:
ACM '76 Proceedings of the 1976 annual conference
Year:
1976

Citing 3
Cited 0

Evaluation and selection of file organization—a model and system

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
Some techniques and trade-offs affecting large data base retrieval times

ACM '69 Proceedings of the 1969 24th national conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

The File Design Analyzer, an analytical model for evaluating storage structures, has been applied to the problem of comparative performance with respect to individual data processing activities ranging from random retrievals to batch update and complex query specification. Performance is defined in terms of I/O processing time so that meaningful quantitative tradeoffs for multiple data processing applications can be determined. The model has been extended to further evaluate storage structures in terms of three levels of secondary storage contention and interference. Considerable insight into database design has been obtained from performance statistics provided by the analytical model. Relative storage structure performance is shown to be highly dependent upon the types of data processing activities required. Less significantly, it is also dependent on how the database is allowed to grow over time and on the level of secondary storage contention.