Algorithmic studies in mass storage systems. (English) Zbl 0537.68102

Berlin-Heidelberg-New York: Springer-Verlag. 411 p., 106 figs., 21 tab. DM 108.00; $ 41.90 (1983).
A major technological trend for large database systems has been the introduction of larger and larger mass storage systems. While large in capacity, mass storage systems have in general relatively long access times. Since record access probabilities are usually not uniform, various record position algorithms have been derived decreasing the average access time. This book is devoted mainly to such algorithmic studies in linear and two-dimensional mass storage systems. The bubble memory is viewed as more than a storage medium. Several structures are discussed, where routine operations, such as data rearrangement, sorting, searching, etc., can be done in the memory itself. The problems discussed in this book are combinatorial in nature. However, to solve them, a wide variety of methods and techniques are employed. They include not only discrete combinatorial and probabilistic methods but also variational calculus, vector majorization and discrete dynamic programming.
Reviewer: J.R.Just


68P20 Information storage and retrieval of data
68P10 Searching and sorting
68P05 Data structures
68-02 Research exposition (monographs, survey articles) pertaining to computer science
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems


Zbl 0537.68101