Abstract
The logical relationships among records in a stored database induce a corresponding structure among disc locations. Database access is manifested as cylinder address sequences conforming to certain statistical patterns. Markov chains have been previously employed to represent empirical seek patterns, and although they provide a useful first approximation, they break down when the effects of detailed implementation features need to be studied. The present approach permits these features to be naturally incorporated. It can be adapted to study systems with arbitrary reference patterns and provides a versatile and economic means for the practical performance assessment of disc database.
| Original language | English |
|---|---|
| Pages (from-to) | 10-14 |
| Number of pages | 5 |
| Journal | Computer Journal |
| Volume | 26 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1983 |
Scopus Subject Areas
- General Computer Science