Data allocation for multidisk databases

摘要

This paper deals with I/O throughput maximization in a single processor/multidisk database system, by means of optimal allocation of entire relations (or other nonfragmented data objects) to disks. We examine the cases in which such allocation is beneficial, and present a mathematical formulation of the problem. This formulation is shown to be flexible enough to accommodate various objectives and constraints of a typical system design.